COIN-OR::LEMON - Graph Library

Opened 7 years ago

Last modified 6 years ago

#412 new task

Implement Dinitz algorithm for the max flow problem

Reported by: kpeter Owned by: alpar
Priority: major Milestone:
Component: core Version: hg main
Keywords: Cc:
Revision id:

Description

It would be nice to implement the "original" Dinitz algorithm for the max flow problem.

We have an implementation that uses dynamic trees, but it would be better to have a separate implementation without dynamic trees, as well.

Change History (1)

comment:1 Changed 6 years ago by kpeter

  • Summary changed from Dinitz algorithm for the max flow problem to Implement Dinitz algorithm for the max flow problem
Note: See TracTickets for help on using tickets.