COIN-OR::LEMON - Graph Library

Changeset 843:189760a7cdd0 in lemon for lemon


Ignore:
Timestamp:
05/07/09 02:05:12 (11 years ago)
Author:
Peter Kovacs <kpeter@…>
Branch:
1.1
Phase:
public
Message:

Remove references of missing tools (#257)

File:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/suurballe.h

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