#6637: standardize the interface to TransitiveIdeal and friends
-------------------------------------+-------------------------------------
Reporter: nthiery | Owner: mhansen
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-6.2
Component: combinatorics | Resolution:
Keywords: backtrack, | Merged in:
enumerated set, transitive | Reviewers:
closure | Work issues:
Authors: | Commit:
Report Upstream: N/A | 5d634535fcee7fcba413170826b03011373505d1
Branch: u/slabbe/6637 | Stopgaps:
Dependencies: #14052 |
-------------------------------------+-------------------------------------
Changes (by slabbe):
* status: new => needs_review
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
The actual proposition is:
{{{
RecursivelyEnumeratedSet(seeds, succ, structure=..., algorithm=...)
}}}
--
--
Ticket URL: <http://trac.sagemath.org/ticket/6637#comment:21>
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.
For more options, visit https://groups.google.com/d/optout.
