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: bea91a6f94

main

Branches Tags

${ item.name }

Create tag ${ searchTerm }

Create branch ${ searchTerm }

from 'bea91a6f94'

${ noResults }

MaxFlowDinic/examples

History

Stefan Pranger bea91a6f94 added examples and README		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	added examples and README	3 years ago