diff -r 48e17328c155 -r f63ba40a60f4 lemon/hartmann_orlin_mmc.h
--- a/lemon/hartmann_orlin_mmc.h	Sun Jan 29 22:33:14 2012 +0100
+++ b/lemon/hartmann_orlin_mmc.h	Mon Jan 30 23:24:14 2012 +0100
@@ -98,7 +98,7 @@
   ///
   /// This class implements the Hartmann-Orlin algorithm for finding
   /// a directed cycle of minimum mean cost in a digraph
-  /// \ref amo93networkflows, \ref dasdan98minmeancycle.
+  /// \ref hartmann93finding, \ref dasdan98minmeancycle.
   /// It is an improved version of \ref KarpMmc "Karp"'s original algorithm,
   /// it applies an efficient early termination scheme.
   /// It runs in time O(ne) and uses space O(n<sup>2</sup>+e).