COIN-OR::LEMON - Graph Library

Changeset 1165:16f55008c863 in lemon for doc


Ignore:
Timestamp:
01/30/12 23:24:40 (8 years ago)
Author:
Peter Kovacs <kpeter@…>
Branch:
default
Phase:
public
Message:

Doc improvements for min cost flow algorithms (#437)

File:
1 edited

Legend:

Unmodified
Added
Removed
  • doc/groups.dox

    r1164 r1165  
    408408
    409409In general, \ref NetworkSimplex and \ref CostScaling are the most efficient
    410 implementations, but the other algorithms could be faster in special cases.
     410implementations.
     411\ref NetworkSimplex is usually the fastest on relatively small graphs (up to
     412several thousands of nodes) and on dense graphs, while \ref CostScaling is
     413typically more efficient on large graphs (e.g. hundreds of thousands of
     414nodes or above), especially if they are sparse.
     415However, other algorithms could be faster in special cases.
    411416For example, if the total supply and/or capacities are rather small,
    412417\ref CapacityScaling is usually the fastest algorithm (without effective scaling).
Note: See TracChangeset for help on using the changeset viewer.