Changes in doc/groups.dox [1003:16f55008c863:919:e0cef67fe565] in lemon-main

File:

• doc/groups.dox (modified) (3 diffs)

doc/groups.dox

@@ -408 +408 @@
 
 In general, \ref NetworkSimplex and \ref CostScaling are the most efficient
-implementations.
-\ref NetworkSimplex is usually the fastest on relatively small graphs (up to
-several thousands of nodes) and on dense graphs, while \ref CostScaling is
-typically more efficient on large graphs (e.g. hundreds of thousands of
-nodes or above), especially if they are sparse.
-However, other algorithms could be faster in special cases.
+implementations, but the other two algorithms could be faster in special cases.
 For example, if the total supply and/or capacities are rather small,
 \ref CapacityScaling is usually the fastest algorithm (without effective scaling).
-
-These classes are intended to be used with integer-valued input data
-(capacities, supply values, and costs), except for \ref CapacityScaling,
-which is capable of handling real-valued arc costs (other numerical
-data are required to be integer).
 */
 
@@ -459 +449 @@
 
 This group contains the algorithms for finding minimum mean cycles
-\ref amo93networkflows, \ref karp78characterization.
+\ref clrs01algorithms, \ref amo93networkflows.
 
 The \e minimum \e mean \e cycle \e problem is to find a directed cycle
@@ -475 +465 @@
 
 LEMON contains three algorithms for solving the minimum mean cycle problem:
-- \ref KarpMmc Karp's original algorithm \ref karp78characterization.
+- \ref KarpMmc Karp's original algorithm \ref amo93networkflows,
+  \ref dasdan98minmeancycle.
 - \ref HartmannOrlinMmc Hartmann-Orlin's algorithm, which is an improved
-  version of Karp's algorithm \ref hartmann93finding.
+  version of Karp's algorithm \ref dasdan98minmeancycle.
 - \ref HowardMmc Howard's policy iteration algorithm
-  \ref dasdan98minmeancycle, \ref dasdan04experimental.
+  \ref dasdan98minmeancycle.
 
 In practice, the \ref HowardMmc "Howard" algorithm turned out to be by far the