Changeset 879:25804ef35064 in lemon for lemon/capacity_scaling.h

Timestamp:

11/12/09 23:52:51 (15 years ago)

Author:

Peter Kovacs <kpeter@…>

Branch:

default

Phase:

public

Rebase:

65336539373836373466333030303164666633626635373132396336363436646237366435313232

Message:

Add citations to the scaling MCF algorithms (#180, #184)
and improve the doc of their group.

File:

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

lemon/capacity_scaling.h

@@ -67 +67 @@
   /// \ref CapacityScaling implements the capacity scaling version
   /// of the successive shortest path algorithm for finding a
-  /// \ref min_cost_flow "minimum cost flow". It is an efficient dual
+  /// \ref min_cost_flow "minimum cost flow" \ref amo93networkflows,
+  /// \ref edmondskarp72theoretical. It is an efficient dual
   /// solution method.
   ///