#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 ncohen):
From the "complexity" point of view, this algorithm is linear in the
number of edges in the graph, so I think it could be filed as "optimal".
From the "practical" point of view, I do not think it would be easy to
improve, though I am more and more thinking about trying to write such
methods in C rather than in Python... Most of the time in these algorithms
is spent on Python considerations rather than on actual Graph
computations...
I am sending a mail to sage-devel about your great idea of a general
"Complexity" note in algorithms.
Nathann
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/7364#comment:7>
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=.
