A simple students project implementing Dinic's Algorithm to compute the max flow/min cut of a network.

You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

Tree: 7ae6db5be1

main

Branches Tags

${ item.name }

Create tag ${ searchTerm }

Create branch ${ searchTerm }

from '7ae6db5be1'

${ noResults }

MaxFlowDinic/examples

History

Stefan Pranger 7ae6db5be1 added uniqueness checks for min cut/max flow		3 years ago
..
1.txt	added examples and README	3 years ago
2.txt	added examples and README	3 years ago
3.txt	added examples and README	3 years ago
FF_killer.txt	allow multiple definition of same arc in input	3 years ago
FF_killer_with_loop.txt	added FF killer example with loop	3 years ago