1.1 --- a/lemon/hartmann_orlin_mmc.h	Thu Mar 18 00:29:35 2010 +0100
     1.2 +++ b/lemon/hartmann_orlin_mmc.h	Thu Mar 18 14:50:32 2010 +0100
     1.3 @@ -38,7 +38,7 @@
     1.4    /// Default traits class of HartmannOrlinMmc class.
     1.5    /// \tparam GR The type of the digraph.
     1.6    /// \tparam CM The type of the cost map.
     1.7 -  /// It must conform to the \ref concepts::Rea_data "Rea_data" concept.
     1.8 +  /// It must conform to the \ref concepts::ReadMap "ReadMap" concept.
     1.9  #ifdef DOXYGEN
    1.10    template <typename GR, typename CM>
    1.11  #else
    1.12 @@ -99,7 +99,7 @@
    1.13    /// This class implements the Hartmann-Orlin algorithm for finding
    1.14    /// a directed cycle of minimum mean cost in a digraph
    1.15    /// \ref amo93networkflows, \ref dasdan98minmeancycle.
    1.16 -  /// It is an improved version of \ref Karp "Karp"'s original algorithm,
    1.17 +  /// It is an improved version of \ref KarpMmc "Karp"'s original algorithm,
    1.18    /// it applies an efficient early termination scheme.
    1.19    /// It runs in time O(ne) and uses space O(n<sup>2</sup>+e).
    1.20    ///