1.1 --- a/lemon/hartmann_orlin_mmc.h	Mon Aug 05 14:21:58 2013 +0200
     1.2 +++ b/lemon/hartmann_orlin_mmc.h	Tue Aug 06 05:38:49 2013 +0200
     1.3 @@ -102,7 +102,7 @@
     1.4    /// This method is based on \ref KarpMmc "Karp"'s original algorithm, but
     1.5    /// applies an early termination scheme. It makes the algorithm
     1.6    /// significantly faster for some problem instances, but slower for others.
     1.7 -  /// The algorithm runs in time O(ne) and uses space O(n<sup>2</sup>+e).
     1.8 +  /// The algorithm runs in time O(nm) and uses space O(n<sup>2</sup>+m).
     1.9    ///
    1.10    /// \tparam GR The type of the digraph the algorithm runs on.
    1.11    /// \tparam CM The type of the cost map. The default