1.1 --- a/lemon/min_cost_flow.h	Fri Feb 29 15:55:39 2008 +0000
     1.2 +++ b/lemon/min_cost_flow.h	Fri Feb 29 15:57:52 2008 +0000
     1.3 @@ -44,10 +44,10 @@
     1.4    ///
     1.5    /// There are four implementations for the minimum cost flow problem,
     1.6    /// which can be used exactly the same way.
     1.7 -  /// - \ref CapacityScaling The capacity scaling algorithm.
     1.8 -  /// - \ref CostScaling The cost scaling algorithm.
     1.9 -  /// - \ref CycleCanceling A cycle-canceling algorithm.
    1.10 -  /// - \ref NetworkSimplex The network simplex algorithm.
    1.11 +  /// - \ref CapacityScaling
    1.12 +  /// - \ref CostScaling
    1.13 +  /// - \ref CycleCanceling
    1.14 +  /// - \ref NetworkSimplex
    1.15    ///
    1.16    /// \tparam Graph The directed graph type the algorithm runs on.
    1.17    /// \tparam LowerMap The type of the lower bound map.