[Lemon-devel] Push/relabel based max.cardinality matching

[Alpár Jüttner]

Hi,

I've just committed push-relabel type bipartite max-matching algorithms
(lemon/bp_matching.h). It is built upon the Elevator class.

It would be very interesting to see some comparison with the other
bipartite matching algorithms available in LEMON (or even with the
implementations that can be found on LEDA, BOOST or somewhere else on
the web).

As usual, any comment is welcome.

Regards,
Alpar