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.
 
 
 
Stefan Pranger 74d9c7cb9b added uniqueness related examples 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
non_unique_max_flow.txt added uniqueness related examples 3 years ago
not_connected.txt added uniqueness related examples 3 years ago
unique_min_cut_testing.txt added uniqueness related examples 3 years ago
uniqueness_test.txt added uniqueness related examples 3 years ago