sp
/
MaxFlowDinic
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity
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.
9 Commits
1 Branch
0 Tags
58 KiB
 
 
 
Tree: 0d4426eb00
Branches Tags
${ item.name }
Create tag ${ searchTerm }
Create branch ${ searchTerm }
from '0d4426eb00'
${ noResults }
MaxFlowDinic/examples
Stefan Pranger 0d4426eb00
updated README 		4 years ago
..
1.txt added examples and README 4 years ago
2.txt added examples and README 4 years ago
3.txt added examples and README 4 years ago
FF_killer.txt allow multiple definition of same arc in input 4 years ago
FF_killer_with_loop.txt added FF killer example with loop 4 years ago
non_unique_max_flow.txt added uniqueness related examples 4 years ago
not_connected.txt added uniqueness related examples 4 years ago
unique_min_cut_testing.txt added uniqueness related examples 4 years ago
uniqueness_test.txt added uniqueness related examples 4 years ago