1.1 --- a/lemon/suurballe.h	Thu Apr 30 11:48:04 2009 +0100
     1.2 +++ b/lemon/suurballe.h	Thu May 07 02:05:12 2009 +0200
     1.3 @@ -45,8 +45,8 @@
     1.4    ///
     1.5    /// Note that this problem is a special case of the \ref min_cost_flow
     1.6    /// "minimum cost flow problem". This implementation is actually an
     1.7 -  /// efficient specialized version of the \ref CapacityScaling
     1.8 -  /// "Successive Shortest Path" algorithm directly for this problem.
     1.9 +  /// efficient specialized version of the Successive Shortest Path
    1.10 +  /// algorithm directly for this problem.
    1.11    /// Therefore this class provides query functions for flow values and
    1.12    /// node potentials (the dual solution) just like the minimum cost flow
    1.13    /// algorithms.