1.1 --- a/lemon/preflow.h	Mon Aug 05 14:21:58 2013 +0200
     1.2 +++ b/lemon/preflow.h	Tue Aug 06 05:38:49 2013 +0200
     1.3 @@ -107,7 +107,7 @@
     1.4    /// The preflow algorithms are the fastest known maximum
     1.5    /// flow algorithms. The current implementation uses a mixture of the
     1.6    /// \e "highest label" and the \e "bound decrease" heuristics.
     1.7 -  /// The worst case time complexity of the algorithm is \f$O(n^2\sqrt{e})\f$.
     1.8 +  /// The worst case time complexity of the algorithm is \f$O(n^2\sqrt{m})\f$.
     1.9    ///
    1.10    /// The algorithm consists of two phases. After the first phase
    1.11    /// the maximum flow value and the minimum cut is obtained. The