1.1 --- a/lemon/cost_scaling.h	Fri Mar 15 17:19:17 2013 +0100
     1.2 +++ b/lemon/cost_scaling.h	Sat Mar 16 13:14:35 2013 +0100
     1.3 @@ -96,6 +96,8 @@
     1.4    /// It is a highly efficient primal-dual solution method, which
     1.5    /// can be viewed as the generalization of the \ref Preflow
     1.6    /// "preflow push-relabel" algorithm for the maximum flow problem.
     1.7 +  /// It is a polynomial algorithm, its running time complexity is
     1.8 +  /// \f$O(n^2e\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 @@ -1269,7 +1271,7 @@
    1.13            int u = _buckets[r];
    1.14            _buckets[r] = _bucket_next[u];
    1.15  
    1.16 -          // Search the incomming arcs of u
    1.17 +          // Search the incoming arcs of u
    1.18            LargeCost pi_u = _pi[u];
    1.19            int last_out = _first_out[u+1];
    1.20            for (int a = _first_out[u]; a != last_out; ++a) {