# Changeset 843:189760a7cdd0 in lemon for lemon/suurballe.h

Ignore:
Timestamp:
05/07/09 02:05:12 (11 years ago)
Branch:
1.1
Phase:
public
Message:

Remove references of missing tools (#257)

File:
1 edited

Unmodified
Added
Removed
• ## lemon/suurballe.h

 r670 /// Note that this problem is a special case of the \ref min_cost_flow /// "minimum cost flow problem". This implementation is actually an /// efficient specialized version of the \ref CapacityScaling /// "Successive Shortest Path" algorithm directly for this problem. /// efficient specialized version of the Successive Shortest Path /// algorithm directly for this problem. /// Therefore this class provides query functions for flow values and /// node potentials (the dual solution) just like the minimum cost flow
Note: See TracChangeset for help on using the changeset viewer.