1.1 --- a/lemon/capacity_scaling.h Mon Aug 05 14:21:58 2013 +0200
1.2 +++ b/lemon/capacity_scaling.h Tue Aug 06 05:38:49 2013 +0200
1.3 @@ -69,7 +69,7 @@
1.4 /// \ref min_cost_flow "minimum cost flow" \cite amo93networkflows,
1.5 /// \cite edmondskarp72theoretical. It is an efficient dual
1.6 /// solution method, which runs in polynomial time
1.7 - /// \f$O(e\log U (n+e)\log n)\f$, where <i>U</i> denotes the maximum
1.8 + /// \f$O(m\log U (n+m)\log n)\f$, where <i>U</i> denotes the maximum
1.9 /// of node supply and arc capacity values.
1.10 ///
1.11 /// This algorithm is typically slower than \ref CostScaling and
1.12 @@ -646,7 +646,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,