#7724: breadth/depth first search for c_graphs
----------------------------+-----------------------------------------------
Reporter: ncohen | Owner: rlm
Type: enhancement | Status: needs_work
Priority: major | Milestone: sage-4.3.1
Component: graph theory | Keywords:
Work_issues: needs rebase | Author: Nathann Cohen
Upstream: N/A | Reviewer: Robert Miller
Merged: |
----------------------------+-----------------------------------------------
Changes (by newvalueoldvalue):
* status: needs_review => needs_work
* reviewer: => Robert Miller
* work_issues: => needs rebase
* author: => Nathann Cohen
Comment:
There's a merging conflict:
{{{
- ALGORITHM: 8.3.8 in [1]. Notice that the termination condition on
- line (23) of the algorithm uses "p[v] == 0" which in the book
- means that the parent is undefined; in this case, v must be the
+ ALGORITHM: 8.3.8 in [Jungnickel2005]_. Notice that the
termination
+ condition on line (23) of the algorithm uses "p[v] == 0" which in
+ the book means that the parent is undefined; in this case, v must
be the
root s. Since our vertex names start with 0, we substitute
instead
the condition "v == s". This is the terminating condition used
in the general Depth First Search tree in Algorithm 8.2.1.
REFERENCE:
- - [1] D. Jungnickel, Graphs, Networks and Algorithms,
+ .. [Jungnickel2005] D. Jungnickel, Graphs, Networks and
Algorithms,
}}}
This change already made it into 4.3.rc1, I believe, in #7314. Can you
rebase on top of that patch?
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/7724#comment:3>
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.
