#8288: Depth/Breadth improvement for SearchForest
-----------------------------+----------------------------------------------
Reporter: nborie | Owner: sage-combinat
Type: enhancement | Status: needs_work
Priority: major | Milestone: sage-4.3.4
Component: combinatorics | Keywords: enumeration depth breadth forest
children
Author: | Upstream: N/A
Reviewer: | Merged:
Work_issues: |
-----------------------------+----------------------------------------------
Changes (by hivert):
* status: needs_review => needs_work
Comment:
Discussed on trac: there is an algorithmic problem:
Here is my tests example:
{{{
I = SearchForest([[3]], lambda l: (l+[i] for i in range(l[-1])))
}}}
Do you have an easy father function for this tree ?
Yes : {{{lambda l -> l[:-1]}}}
It simply generate strictly decreasing lists starting with 3.
For me a call to
{{{
list(I.element_of_depth_iterator(2, "Children"))
}}}
raise a {{{StopIteration}}} ...
Whereas:
{{{
sage: list(I.element_of_depth_iterator(2))
[[3, 1, 0], [3, 2, 0], [3, 2, 1]]
}}}
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/8288#comment:8>
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.
