1.1 --- a/lemon/cycle_canceling.h	Fri Mar 15 17:19:17 2013 +0100
     1.2 +++ b/lemon/cycle_canceling.h	Sat Mar 16 13:14:35 2013 +0100
     1.3 @@ -51,9 +51,9 @@
     1.4    /// \ref goldberg89cyclecanceling.
     1.5    /// The most efficent one is the \ref CANCEL_AND_TIGHTEN
     1.6    /// "Cancel-and-Tighten" algorithm, thus it is the default method.
     1.7 -  /// It runs in strongly polynomial time, but in practice, it is typically
     1.8 -  /// orders of magnitude slower than the scaling algorithms and
     1.9 -  /// \ref NetworkSimplex.
    1.10 +  /// It runs in strongly polynomial time O(n<sup>2</sup>e<sup>2</sup>log(n)),
    1.11 +  /// but in practice, it is typically orders of magnitude slower than
    1.12 +  /// the scaling algorithms and \ref NetworkSimplex.
    1.13    /// (For more information, see \ref min_cost_flow_algs "the module page".)
    1.14    ///
    1.15    /// Most of the parameters of the problem (except for the digraph)