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