Re: [networkx-discuss] Finding the Maximum Matching of a Graph in NetworkX
120 views
Skip to first unread message
Aric Hagberg
Aug 24, 2012, 10:59:47 AM8/24/12
to networkx...@googlegroups.com
On Thu, Aug 23, 2012 at 4:34 PM, Jeff Hoogland <jeffho...@gmail.com> wrote:
> Is there a function, or has any work been done on creating a function, that
> calculates the maximum matching of a given graph in networkx?
>
> I see there is a function for calculating the maximal matching of a graph,
> but this is different from a maximum matching.
How about the maximum weight matching algorithm?
http://networkx.lanl.gov/reference/generated/networkx.algorithms.matching.max_weight_matching.html
Aric
> Is there a function, or has any work been done on creating a function, that
> calculates the maximum matching of a given graph in networkx?
>
> I see there is a function for calculating the maximal matching of a graph,
> but this is different from a maximum matching.
How about the maximum weight matching algorithm?
http://networkx.lanl.gov/reference/generated/networkx.algorithms.matching.max_weight_matching.html
Aric
Reply all
Reply to author
Forward
0 new messages