From: Doug Gregor (dgregor_at_[hidden])
Date: 2004-10-12 12:13:58
On Oct 12, 2004, at 10:27 AM, Gunnar W. Klau wrote:
> does anybody know whether there's an implementation to compute
> (maximum weight) matchings in general graphs?
We do not have such an implementation in the Boost Graph Library.
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk