#8288: Depth/Breadth improvement for SearchForest
-----------------------------+----------------------------------------------
Reporter: nborie | Owner: sage-combinat
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-4.3.3
Component: combinatorics | Keywords: enumeration depth breadth forest
children
Author: | Upstream: N/A
Reviewer: | Merged:
Work_issues: |
-----------------------------+----------------------------------------------
Comment(by ncohen):
Hello !! I know nothing about the file sage/combinat/backtrack.py, and I
intend to read it as soon as possible but I saw on TRAC the same of this
patch, and I was convinced it woukd be using the Graph library : in
sage/graphs/base/c_graph.pyx are written iterators for depth/breadth-
first-search in general graphs.. Wouldn't it be better for this class to
use such functions, are they are written in Cython and should be more
efficient ? Or directly use the Graph structure, as it would automatically
call these functions.. :-)
Nathann
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/8288#comment:2>
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.
