Opened 15 years ago
Last modified 8 years ago
#244 assigned enhancement
Support min. cost max. flow in MCF classes
| Reported by: | Peter Kovacs | Owned by: | Peter Kovacs |
|---|---|---|---|
| Priority: | major | Milestone: | LEMON 1.5 release |
| Component: | core | Version: | hg main |
| Keywords: | Cc: | ||
| Revision id: |
Description (last modified by )
The new concept of the min cost flow classes (see #234) makes it easy to provide interface for the min. cost maximum flow problem, too.
For 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.
Change History (4)
comment:1 Changed 15 years ago by
| Description: | modified (diff) |
|---|---|
| Status: | new → assigned |
comment:2 Changed 14 years ago by
| Milestone: | LEMON 1.2 release → LEMON 1.3 release |
|---|
comment:3 Changed 11 years ago by
| Milestone: | LEMON 1.3 release → LEMON 1.4 release |
|---|
comment:4 Changed 8 years ago by
| Milestone: | LEMON 1.4 release → LEMON 1.5 release |
|---|
Note: See
TracTickets for help on using
tickets.
Or we could introduce a separate wrapper class, which could be heuristic in a sense that it could choose the most promising MCF implementation according to the parameters of the problem (size of the graph, density, max. capacity etc.).