#8166: Expose max_weight_matching from NetworkX
----------------------------+-----------------------------------------------
Reporter: ncohen | Owner: rlm
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-4.4.2
Component: graph theory | Keywords:
Author: | Upstream: N/A
Reviewer: | Merged:
Work_issues: |
----------------------------+-----------------------------------------------
Changes (by ncohen):
* cc: jason, mvngu (added)
* status: new => needs_review
Comment:
As max_weight_matching had been exposed while I wasn't looking, this
ticket now merges the two function into only one, for the better I hope !
:-)
From now on, maximum matching are not optional anymore, and are way faster
!
{{{
sage: g = graphs.RandomGNP(50,.3)
sage: %timeit g.matching(algorithm="LP",solver="GLPK")
5 loops, best of 3: 248 ms per loop
sage: %timeit g.matching()
25 loops, best of 3: 16.9 ms per loop
}}}
The two different ways to solve matchings are kept, just in case.... But
network'x version is now the default one, obviously :-)
Requires #8364
Nathann
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/8166#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.
