# Changeset 835:c92296660262 in lemon for lemon/preflow.h

Ignore:
Timestamp:
11/18/09 14:38:02 (13 years ago)
Branch:
default
Parents:
834:c2230649a493 (diff), 833:e20173729589 (diff)
Note: this is a merge changeset, the changes displayed below correspond to the merge itself.
Use the (diff) links above to see all the changes relative to each parent.
Phase:
public
Message:

Merge

Files:
2 edited

Unmodified
Removed
• ## lemon/preflow.h

 r833 /// This class provides an implementation of Goldberg-Tarjan's \e preflow /// \e push-relabel algorithm producing a \ref max_flow /// "flow of maximum value" in a digraph. /// "flow of maximum value" in a digraph \ref clrs01algorithms, /// \ref amo93networkflows, \ref goldberg88newapproach. /// The preflow algorithms are the fastest known maximum /// flow algorithms. The current implementation uses a mixture of the
• ## lemon/preflow.h

 r802 /// able to automatically created by the algorithm (i.e. the /// digraph and the maximum level should be passed to it). /// However an external elevator object could also be passed to the /// However, an external elevator object could also be passed to the /// algorithm with the \ref elevator(Elevator&) "elevator()" function /// before calling \ref run() or \ref init().
Note: See TracChangeset for help on using the changeset viewer.