COIN-OR::LEMON - Graph Library

Changeset 1217:7bf489cf624e in lemon for doc


Ignore:
Timestamp:
03/16/13 13:14:35 (7 years ago)
Author:
Peter Kovacs <kpeter@…>
Branch:
default
Phase:
public
Message:

Minor fixes and improvements in the doc (#459)

File:
1 edited

Legend:

Unmodified
Added
Removed
  • doc/groups.dox

    r1206 r1217  
    393393This group contains the algorithms for finding minimum cost flows and
    394394circulations \ref amo93networkflows. For more information about this
    395 problem and its dual solution, see \ref min_cost_flow
     395problem and its dual solution, see: \ref min_cost_flow
    396396"Minimum Cost Flow Problem".
    397397
     
    485485time is exponential.
    486486Both \ref KarpMmc "Karp" and \ref HartmannOrlinMmc "Hartmann-Orlin" algorithms
    487 run in time O(ne) and use space O(n<sup>2</sup>+e), but the latter one is
    488 typically faster due to the applied early termination scheme.
     487run in time O(ne) and use space O(n<sup>2</sup>+e).
    489488*/
    490489
Note: See TracChangeset for help on using the changeset viewer.