#7854: speed up edge_connectivity in easy cases
----------------------------+-----------------------------------------------
Reporter: ncohen | Owner: rlm
Type: defect | Status: new
Priority: major | Milestone: sage-4.3.1
Component: graph theory | Keywords:
Work_issues: | Author:
Upstream: N/A | Reviewer:
Merged: |
----------------------------+-----------------------------------------------
This functions uses LP and has a big overhead because of that... Is many
cases, though, the graph is not connected, or not 2-connected.
To test if a graph is connected, we already have the function is_connected
which does the job very efficiently through depth-first-searches.
We also have a function is_strongly_connected for DiGraphs.
To test if a Graph is 2-connected, we can first :
* compute a strongly_connected_orientation with a linear-time function
* check whether the returned graph is strongly-connected ( linear time
too )
Without this, much time is spent over building a useless Linear Program.
Nathann
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/7854>
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.
