1.1 --- a/lemon/gomory_hu.h	Mon Jul 16 16:21:40 2018 +0200
     1.2 +++ b/lemon/gomory_hu.h	Wed Oct 17 19:14:07 2018 +0200
     1.3 @@ -2,7 +2,7 @@
     1.4   *
     1.5   * This file is a part of LEMON, a generic C++ optimization library.
     1.6   *
     1.7 - * Copyright (C) 2003-2010
     1.8 + * Copyright (C) 2003-2013
     1.9   * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
    1.10   * (Egervary Research Group on Combinatorial Optimization, EGRES).
    1.11   *
    1.12 @@ -46,7 +46,7 @@
    1.13    /// of nodes can easily be obtained.
    1.14    ///
    1.15    /// The algorithm calculates \e n-1 distinct minimum cuts (currently with
    1.16 -  /// the \ref Preflow algorithm), thus it has \f$O(n^3\sqrt{e})\f$ overall
    1.17 +  /// the \ref Preflow algorithm), thus it has \f$O(n^3\sqrt{m})\f$ overall
    1.18    /// time complexity. It calculates a rooted Gomory-Hu tree.
    1.19    /// The structure of the tree and the edge weights can be
    1.20    /// obtained using \c predNode(), \c predValue() and \c rootDist().