1.1 --- a/lemon/hartmann_orlin_mmc.h	Fri Mar 15 17:19:17 2013 +0100
     1.2 +++ b/lemon/hartmann_orlin_mmc.h	Sat Mar 16 13:14:35 2013 +0100
     1.3 @@ -99,9 +99,10 @@
     1.4    /// This class implements the Hartmann-Orlin algorithm for finding
     1.5    /// a directed cycle of minimum mean cost in a digraph
     1.6    /// \ref hartmann93finding, \ref dasdan98minmeancycle.
     1.7 -  /// It is an improved version of \ref KarpMmc "Karp"'s original algorithm,
     1.8 -  /// it applies an efficient early termination scheme.
     1.9 -  /// It runs in time O(ne) and uses space O(n<sup>2</sup>+e).
    1.10 +  /// This method is based on \ref KarpMmc "Karp"'s original algorithm, but
    1.11 +  /// applies an early termination scheme. It makes the algorithm
    1.12 +  /// significantly faster for some problem instances, but slower for others.
    1.13 +  /// The algorithm runs in time O(ne) and uses space O(n<sup>2</sup>+e).
    1.14    ///
    1.15    /// \tparam GR The type of the digraph the algorithm runs on.
    1.16    /// \tparam CM The type of the cost map. The default
    1.17 @@ -274,8 +275,8 @@
    1.18      /// found cycle.
    1.19      ///
    1.20      /// If you don't call this function before calling \ref run() or
    1.21 -    /// \ref findCycleMean(), it will allocate a local \ref Path "path"
    1.22 -    /// structure. The destuctor deallocates this automatically
    1.23 +    /// \ref findCycleMean(), a local \ref Path "path" structure
    1.24 +    /// will be allocated. The destuctor deallocates this automatically
    1.25      /// allocated object, of course.
    1.26      ///
    1.27      /// \note The algorithm calls only the \ref lemon::Path::addFront()