Hi,

I was wondering if BGL contains algorithms for (weighted and unweighted)
bipartite matching; the documentation site (
http://www.boost.org/libs/graph/doc/table_of_contents.html) shows no trace
of such algorithms, neither does googling the users mailing list.

Thanks for the help,
Firas.