COIN-OR::LEMON - Graph Library

Changes between Version 2 and Version 4 of Ticket #319


Ignore:
Timestamp:
11/04/09 19:13:49 (15 years ago)
Author:
Peter Kovacs
Comment:

I suggest to apply the first solution soon. The second or third solution could be done later, but they are not as critical as adding a warning about this problem to the documentation.

Legend:

Unmodified
Added
Removed
Modified
  • Ticket #319

    • Property Milestone changed from to LEMON 1.2 release
  • Ticket #319 – Description

    v2 v4  
    44 1. Add a warning about this problem to the doc of the class and the dimacs solver.
    55 2. Support infinite capacities in the algorithm (and in the dimacs solver as well). We could search for a finite cut and replace the infinite capacities on the outgoing arcs of the source node with the value of the found cut if such a cut exists. Otherwise the max. flow value is infinite.
    6 
    7 A possible combination would be to choose the first solution and create a wrapper function/class for `Preflow` that supports infinite capacities applying the second solution.
     6 3. A possible combination would be to choose the first solution and create a wrapper function/class for `Preflow` that supports infinite capacities applying the second solution.