1.1 --- a/lemon/cost_scaling.h	Mon Aug 05 14:21:58 2013 +0200
     1.2 +++ b/lemon/cost_scaling.h	Tue Aug 06 05:38:49 2013 +0200
     1.3 @@ -97,7 +97,7 @@
     1.4    /// can be viewed as the generalization of the \ref Preflow
     1.5    /// "preflow push-relabel" algorithm for the maximum flow problem.
     1.6    /// It is a polynomial algorithm, its running time complexity is
     1.7 -  /// \f$O(n^2e\log(nK))\f$, where <i>K</i> denotes the maximum arc cost.
     1.8 +  /// \f$O(n^2m\log(nK))\f$, where <i>K</i> denotes the maximum arc cost.
     1.9    ///
    1.10    /// In general, \ref NetworkSimplex and \ref CostScaling are the fastest
    1.11    /// implementations available in LEMON for solving this problem.
    1.12 @@ -670,7 +670,7 @@
    1.13      /// \brief Return the total cost of the found flow.
    1.14      ///
    1.15      /// This function returns the total cost of the found flow.
    1.16 -    /// Its complexity is O(e).
    1.17 +    /// Its complexity is O(m).
    1.18      ///
    1.19      /// \note The return type of the function can be specified as a
    1.20      /// template parameter. For example,