#7854: speed up edge_connectivity in easy cases
----------------------------+-----------------------------------------------
Reporter: ncohen | Owner: rlm
Type: defect | Status: needs_review
Priority: major | Milestone: sage-4.3.4
Component: graph theory | Keywords:
Author: | Upstream: N/A
Reviewer: | Merged:
Work_issues: |
----------------------------+-----------------------------------------------
Changes (by ncohen):
* status: needs_info => needs_review
Comment:
Hello !!!!
Actually, the patch works with any LP solver which is installed.
What you get is is a totally unrelated "bug". After installing the package
corresponding to a LP solver, the user has to run "sage -b" but has no way
to know about it for the moment. There is an update of GLPK waiting for
review (#8298) and Cbc will follow (#8171). Sorry for the trouble !
This patch just avoids the use of LP when it is possible -- when the graph
isn't connected, or not 2-connected. The functions used are written in
Cython, which makes them almost instantaneous to use. Actually, checking
the connectivity for low values this way is even faster than just
generating the linear program, so it definitely is good to have :-)
Nathann
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/7854#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.
