#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
----------------------------+-----------------------------------------------
Old description:
> Currently, there is only a function for finding an eulerian '''circuit'''
> in an '''un'''directed graph.
New description:
Currently, there is only a function for finding an eulerian '''circuit'''
in an '''un'''directed graph.
Apply :
* [attachment:trac_12325_eulerian_move.patch]
* [attachment:trac_12325_eulerian_paths.2.patch]
--
Comment(by ncohen):
Hellooooooooooooo !!!
Great ! Thank you very much for these two patches, it is much easier to
read. And you also factored things like many (g.degree(u)-g.degree(v))
`:-)`
Well, I see nothing wrong with this patch, it passes all tests and does it
job. Could you rebase the first of your two patches over sage-4.5-beta1
though ? It still does not apply.
Nathann
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/12325#comment:4>
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.
