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

Timestamp:

02/29/08 16:57:52 (16 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:

• lemon/min_cost_flow.h (modified) (1 diff)

lemon/min_cost_flow.h

@@ -45 +45 @@
   /// There are four implementations for the minimum cost flow problem,
   /// which can be used exactly the same way.
-  /// - \ref CapacityScaling The capacity scaling algorithm.
-  /// - \ref CostScaling The cost scaling algorithm.
-  /// - \ref CycleCanceling A cycle-canceling algorithm.
-  /// - \ref NetworkSimplex The network simplex algorithm.
+  /// - \ref CapacityScaling
+  /// - \ref CostScaling
+  /// - \ref CycleCanceling
+  /// - \ref NetworkSimplex
   ///
   /// \tparam Graph The directed graph type the algorithm runs on.