1.1 --- a/lemon/capacity_scaling.h Fri Mar 15 17:19:17 2013 +0100
1.2 +++ b/lemon/capacity_scaling.h Sat Mar 16 13:14:35 2013 +0100
1.3 @@ -68,7 +68,9 @@
1.4 /// of the successive shortest path algorithm for finding a
1.5 /// \ref min_cost_flow "minimum cost flow" \ref amo93networkflows,
1.6 /// \ref edmondskarp72theoretical. It is an efficient dual
1.7 - /// solution method.
1.8 + /// solution method, which runs in polynomial time
1.9 + /// \f$O(e\log U (n+e)\log n)\f$, where <i>U</i> denotes the maximum
1.10 + /// of node supply and arc capacity values.
1.11 ///
1.12 /// This algorithm is typically slower than \ref CostScaling and
1.13 /// \ref NetworkSimplex, but in special cases, it can be more