#8166: Expose max_weight_matching from NetworkX
----------------------------+-----------------------------------------------
Reporter: ncohen | Owner: rlm
Type: defect | Status: new
Priority: major | Milestone: sage-4.3.2
Component: graph theory | Keywords:
Author: | Upstream: N/A
Reviewer: | Merged:
Work_issues: |
----------------------------+-----------------------------------------------
Description changed by ncohen:
Old description:
> Since the new version of NetworkX is being merged into Sage, we could use
> their max matching algorithm. We already have one, though it uses Linear
> Programming and is optional :
>
> The efficiency of these two algorithms have to be compared !
>
> Based upon this, the default behaviour could be :
> * To always use NetworkX
> * Only use it if there is no LP available
> * Not to use it if not asked explicitely
>
> Nathann
New description:
Since the new version of NetworkX is being merged into Sage #7608, we
could use their max matching algorithm. We already have one, though it
uses Linear Programming and is optional :
The efficiency of these two algorithms have to be compared !
Based upon this, the default behaviour could be :
* To always use NetworkX
* Only use it if there is no LP available
* Not to use it if not asked explicitely
Nathann
--
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/8166#comment:1>
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.
