Re: [Boost-users] BGL (Boost Graph Library) MaxWeightedMatching algorithm

Subject: Re: [Boost-users] BGL (Boost Graph Library) MaxWeightedMatching algorithm
From: Jeremiah Willcock (jewillco_at_[hidden])
Date: 2013-09-25 10:42:22

On Wed, 25 Sep 2013, Pablo Madoery wrote:

> Hello, i want to use an algorithm called  MaxWeightedMatching : Edmond's blossom shrinking algorithm for calculating
> maximum weighted matching in general graphs. I note that there is an algorithm in BGL called 
>  1. edmonds_maximum_cardinality_matching 
> but this is not what I want. I need to take in count the weights.
> I would like to know if this algorithm can be taken in count in the next version of Boost or if you can tell
> me some advices to implement it using BGL. The  MaxWeightedMatching algorithm is already implemented in LEMON
> library: http://www.loco.ic.unicamp.br/~msambinelli/lemon_doc/a00537.html.

I do not know of an implementation for BGL, and there will not be one in 
the next release unless someone contributes one.  Another implementation 
you can use is linked from 
<URL:http://lists.boost.org/Archives/boost/2007/10/129535.php>.

-- Jeremiah Willcock