#6637: standardize the interface to TransitiveIdeal and friends
-----------------------------------------------------------------+----------
Reporter: nthiery |
Owner: mhansen
Type: enhancement |
Status: new
Priority: major |
Milestone: sage-5.7
Component: combinatorics |
Resolution:
Keywords: backtrack, enumerated set, transitive closure | Work
issues:
Report Upstream: N/A |
Reviewers:
Authors: | Merged
in:
Dependencies: |
Stopgaps:
-----------------------------------------------------------------+----------
Description changed by slabbe:
Old description:
> 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
New description:
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#comment:3>
Sage <http://www.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 unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sage-trac?hl=en.
For more options, visit https://groups.google.com/groups/opt_out.
