#6000: Sets enumerated by exploring a search space with a (lazy) tree or graph
structure
---------------------------+------------------------------------------------
Reporter: nthiery | Owner: nthiery
Type: enhancement | Status: new
Priority: major | Milestone: sage-4.0
Component: combinatorics | Keywords: enumerate sets, depth first search,
ideal of a relation
---------------------------+------------------------------------------------
This patches extend the sage.combinat.backtrack library with other
generic tools for constructing large sets whose elements can be
enumerated by exploring a search space with a (lazy) tree or graph
structure.
- SearchForest:
Depth first search through a tree descrived by a `child` function
- GenericBacktracker: (was readilly there)
Depth first search through a tree descrived by a `child` function, with
branch pruning, ...
- TransitiveIdeal:
Depth first search through a graph described by a `neighbours` relation
- TransitiveIdealGraded:
Breath first search through a graph described by a `neighbours`
relation
Todo: the names are crappy and inconsistent, because they come from
different point of views. We need to find a good naming scheme!!!
Do we want to emphasize the underlying graph/tree structure? The
branch&bound aspect? The transitive closure of a relation point of
view?
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/6000>
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
-~----------~----~----~----~------~----~------~--~---
