#7364: Eulerian orientation of a graph
----------------------------+-----------------------------------------------
Reporter: ncohen | Owner: rlm
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-4.3
Component: graph theory | Keywords:
Work_issues: | Author:
Upstream: N/A | Reviewer: Florent Hivert
Merged: |
----------------------------+-----------------------------------------------
Comment(by hivert):
Replying to [comment:14 ncohen]:
> This patch should suit you :-)
I'm really sorry to bother you again:
> This algorithm has complexity `O(m)`.
Is this a standard in graph theory to call 'm' the number of ??? Actually
what ? Edge, Vertex or sum of Both... Maybe this is obvious but better
explicit than implicit ;-)
I promiss I'll give you a positive review after that !
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/7364#comment:15>
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=.
