#6000: [with patch, positive review] Sets enumerated by exploring a search space
with a (lazy) tree or graph structure
---------------------------+------------------------------------------------
Reporter: nthiery | Owner: nthiery
Type: enhancement | Status: assigned
Priority: major | Milestone: sage-4.0.1
Component: combinatorics | Keywords: enumerate sets, depth first search,
ideal of a relation
---------------------------+------------------------------------------------
Comment(by rbeezer):
Passes tests: ./sage -t devel/sage-backtrack/sage/combinat/
Reviewer patch adds two doctests, and some general cleanup, so apply on
top of the main patch.
In the case of a search tree (not a graph), options for "leaves only"
would be useful. Then the generators could be checked for a first element
when using a search tree for existence questions.
Building a single function to call these routines as variants might ease
the question of names and interfaces.
Positive review.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/6000#comment:3>
Sage <http://sagemath.org/>
Sage - Open Source Mathematical Software: Building the Car Instead of
Reinventing the Wheel
--~--~---------~--~----~------------~-------~--~----~
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
-~----------~----~----~----~------~----~------~--~---
