#6637: Follow up on #6000: standardize the interface to TransitiveIdeal and
friends
---------------------------+------------------------------------------------
Reporter: nthiery | Owner: mhansen
Type: enhancement | Status: new
Priority: major | Milestone: sage-combinat
Component: combinatorics | Keywords: backtrack, enumerated set,
transitive closure
Reviewer: | Author:
Merged: |
---------------------------+------------------------------------------------
Implement a single entry point:
{{{
TransitiveClosure(roots, operators = ..., children = , acyclic =
True, algo = "DFS", "BFS", internal_nodes = False)
}}}
for all the functions in sage.combinat.backtrack.py SearchForest,
TransitiveIdeal, TransitiveIdealGraded
TODO: discuss the names above
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/6637>
Sage <http://sagemath.org/>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To post to this group, send email to [email protected]
To unsubscribe from this group, send email to
[email protected]
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en
-~----------~----~----~----~------~----~------~--~---
