1.1 --- a/lemon/gomory_hu.h	Mon Aug 05 14:21:58 2013 +0200
     1.2 +++ b/lemon/gomory_hu.h	Tue Aug 06 05:38:49 2013 +0200
     1.3 @@ -46,7 +46,7 @@
     1.4    /// of nodes can easily be obtained.
     1.5    ///
     1.6    /// The algorithm calculates \e n-1 distinct minimum cuts (currently with
     1.7 -  /// the \ref Preflow algorithm), thus it has \f$O(n^3\sqrt{e})\f$ overall
     1.8 +  /// the \ref Preflow algorithm), thus it has \f$O(n^3\sqrt{m})\f$ overall
     1.9    /// time complexity. It calculates a rooted Gomory-Hu tree.
    1.10    /// The structure of the tree and the edge weights can be
    1.11    /// obtained using \c predNode(), \c predValue() and \c rootDist().