COIN-OR::LEMON - Graph Library

Opened 10 years ago

Last modified 2 years ago

#238 new enhancement

Min cut iterators in Preflow

Reported by: Peter Kovacs Owned by: Alpar Juttner
Priority: major Milestone: LEMON 1.5 release
Component: core Version: hg main
Keywords: Cc:
Revision id:

Description

It would be nice to have iterators for obtaining the min. cut in Preflow class. E.g. there could be MinCutNodeIt and MinCutArcIt similarly to the ones in GomoryHu class (but note that in Preflow we have directed cuts).

Change History (4)

comment:1 Changed 10 years ago by Peter Kovacs

We could also have such iterator classes for HaoOrlin algorithm and in other maximum flow and minimum cut algrorithms that will be ported in the future: EdmondsKarp, GoldbergTarjan, DinitzSleatorTarjan and NagamochiIbaraki.

comment:2 Changed 9 years ago by Peter Kovacs

Milestone: LEMON 1.3 release

comment:3 Changed 6 years ago by Alpar Juttner

Milestone: LEMON 1.3 releaseLEMON 1.4 release

comment:4 Changed 2 years ago by Alpar Juttner

Milestone: LEMON 1.4 releaseLEMON 1.5 release
Note: See TracTickets for help on using tickets.