COIN-OR::LEMON - Graph Library

Changeset 2588:4d3bc1d04c1d in lemon-0.x for lemon/min_cost_flow.h


Ignore:
Timestamp:
02/29/08 16:57:52 (12 years ago)
Author:
Peter Kovacs
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@3470
Message:

Small improvements in min cost flow files.

File:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/min_cost_flow.h

    r2581 r2588  
    4545  /// There are four implementations for the minimum cost flow problem,
    4646  /// which can be used exactly the same way.
    47   /// - \ref CapacityScaling The capacity scaling algorithm.
    48   /// - \ref CostScaling The cost scaling algorithm.
    49   /// - \ref CycleCanceling A cycle-canceling algorithm.
    50   /// - \ref NetworkSimplex The network simplex algorithm.
     47  /// - \ref CapacityScaling
     48  /// - \ref CostScaling
     49  /// - \ref CycleCanceling
     50  /// - \ref NetworkSimplex
    5151  ///
    5252  /// \tparam Graph The directed graph type the algorithm runs on.
Note: See TracChangeset for help on using the changeset viewer.