COIN-OR::LEMON - Graph Library

Opened 9 years ago

Last modified 14 months ago

#238 new enhancement

Min cut iterators in Preflow

Reported by: kpeter Owned by: alpar
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 8 years ago by kpeter

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 8 years ago by kpeter

  • Milestone set to LEMON 1.3 release

comment:3 Changed 5 years ago by alpar

  • Milestone changed from LEMON 1.3 release to LEMON 1.4 release

comment:4 Changed 14 months ago by alpar

  • Milestone changed from LEMON 1.4 release to LEMON 1.5 release
Note: See TracTickets for help on using tickets.