1.1 --- a/lemon/karp_mmc.h Mon Aug 05 14:21:58 2013 +0200
1.2 +++ b/lemon/karp_mmc.h Tue Aug 06 05:38:49 2013 +0200
1.3 @@ -99,7 +99,7 @@
1.4 /// This class implements Karp's algorithm for finding a directed
1.5 /// cycle of minimum mean cost in a digraph
1.6 /// \cite karp78characterization, \cite dasdan98minmeancycle.
1.7 - /// It runs in time O(ne) and uses space O(n<sup>2</sup>+e).
1.8 + /// It 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