#12325: Eulerian circuits/paths for (di)graphs
----------------------------+-----------------------------------------------
Reporter: brunellus | Owner: jason, ncohen, rlm
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-5.0
Component: graph theory | Keywords:
Work_issues: | Upstream: N/A
Reviewer: | Author:
Merged: | Dependencies: #10135
----------------------------+-----------------------------------------------
Comment(by brunellus):
Hi, thanks for the remarks very much.
I tried to rewrite the fix -- you are certainly right that the
eulerianess-checking code should be in the is_eulerian function. I am a
big fan of "the lazy way" :-), but in this case it makes almost no
difference, because there are no changes in the algorithm needed for
allowing the path computation -- the only important step is setting the
start_vertex variable. And thanks for the advice about two patches -- it
definitelly makes sense.
Lukáš.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/12325#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.
