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