#7358: Strong orientations of 2-connected graphs
----------------------------+-----------------------------------------------
Reporter: ncohen | Owner: rlm
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-4.3.1
Component: graph theory | Keywords:
Work_issues: | Author:
Upstream: N/A | Reviewer:
Merged: |
----------------------------+-----------------------------------------------
Changes (by ncohen):
* status: needs_work => needs_review
Comment:
I added a definition of both "orientation" and "strong", plsu a reference
to the wikipedia page, and described the output. This function is actually
useful in both situations ( when the graph is not 2-connected, or when it
is ), so I removed "of a 2-connected graph" in the first sentence of the
docstring : it is explicitely written later that if the graph is not
2-connected, the result will be "as best as can be hoped for" in this
situation ( and I assure you this part of the function is useful by itself
:-) )
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/7358#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.
