Changeset 1049:7bf489cf624e in lemon-main for lemon/capacity_scaling.h

Timestamp:

03/16/13 13:14:35 (11 years ago)

Author:

Peter Kovacs <kpeter@…>

Branch:

default

Phase:

public

Message:

Minor fixes and improvements in the doc (#459)

File:

• lemon/capacity_scaling.h (modified) (1 diff)

lemon/capacity_scaling.h

@@ -69 +69 @@
   /// \ref min_cost_flow "minimum cost flow" \ref amo93networkflows,
   /// \ref edmondskarp72theoretical. It is an efficient dual
-  /// solution method.
+  /// solution method, which runs in polynomial time
+  /// \f$O(e\log U (n+e)\log n)\f$, where <i>U</i> denotes the maximum
+  /// of node supply and arc capacity values.
   ///
   /// This algorithm is typically slower than \ref CostScaling and