[Boost-users] BGL : maximum weighted matching

From: Alessio Dore (dore_at_[hidden])
Date: 2007-11-30 04:46:10

Dear all,

I am implementing an algorithm for which I would need to compute the
maximum weighted matching of a bipartite graphs. I have seen that LEDA
libraries has this sort of functions but their license is restrictive.
BGL allows maximum cardinality matching but, if I understood well, it
works for non-weighted graphs. In a previous message on this list it was
mentioned that this functionality could have been added but I didn't
find it. Is it available? Does anyone of you know if there are other
libraries to perform it?
Thanks.

Regrads,
Alessio