# Changeset 1217:7bf489cf624e in lemon for doc

Ignore:
Timestamp:
03/16/13 13:14:35 (7 years ago)
Branch:
default
Phase:
public
Message:

Minor fixes and improvements in the doc (#459)

File:
1 edited

Unmodified
Removed
• ## doc/groups.dox

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