[Lemon-devel] Experiment with push-relabel matching alg.

[Jacint Szabo]

> I've conducted some experimental evaluation with the Elevator class and
> the bipartite matching algorithm based on the push-relabel principle.
> Namely, this class use a data structure that makes is possible to
> recognize when an empty level appears, and it can lift all items above
> this empty level to the highest one. Therefore I compared the original
> version with an improved one that lifts the element above an empty level
> to the top whenever it appears.
>
> Jacint, does the max flow algorithm use this block lifting feature?

 It is not really specified. Block lifting is a well-known technique
which you can use if you like. The LEMON preflow push implementation
contains it as it speeds up the algorithm.

 Jacint