COIN-OR::LEMON - Graph Library

Changes between Initial Version and Version 1 of Ticket #244


Ignore:
Timestamp:
03/25/09 22:30:07 (11 years ago)
Author:
Peter Kovacs
Comment:

Legend:

Unmodified
Added
Removed
Modified
  • Ticket #244

    • Property Status changed from new to assigned
  • Ticket #244 – Description

    initial v1  
    11The new concept of the min cost flow classes (see #234) makes it easy to provide interface for the min. cost maximum flow problem, too.
    22
    3 E.g. there could be a `maxFlow(Node s, Node t)` function, which could be used instead of `supplyMap()` and `stSupply()`. In this case `Preflow::runMinCut()` should be called to determine the max. flow value (instead of `Circualtion`), and the algorithm have to be initialized as if `stSupport()` was called with this flow value. However apart from that nothing have to be changed.
     3For example, there could be a `maxFlow(Node s, Node t)` function, which could be used instead of `supplyMap()` and `stSupply()`. In this case `Preflow::runMinCut()` should be called to determine the max. flow value (instead of `Circualtion`), and the algorithm have to be initialized as if `stSupport()` was called with this flow value. However apart from that nothing have to be changed.