#8288: Depth/Breadth improvement for SearchForest
-----------------------------+----------------------------------------------
Reporter: nborie | Owner: sage-combinat
Type: enhancement | Status: new
Priority: major | Milestone: sage-4.3.3
Component: combinatorics | Keywords: enumeration depth breadth forest
children
Author: | Upstream: N/A
Reviewer: | Merged:
Work_issues: |
-----------------------------+----------------------------------------------
The goal of this patch is to include breadth enumeration method for
SearchForest...
The interested is for enumerated Set defined by a set of roots and a
children function. For a finite set of roots but infinite set (infinite
depth of the tree), the breadth method is a necessity.
The breadth method is also a need to define properly indices of infinite
Graded algebra (but finite degree by degree). The patch contains method
returning iterator of all element of given depth.
Using extra argument : father and next_brother method, it is possible to
enumerate not starting from the roots of trees. a _iter_from_to method
build an iterator keeping nothing in memory than the first and the last
point.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/8288>
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 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.
