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.
 
 
 

8 lines
50 B

5 7 1 5
1 3 5
1 4 3
3 4 3
4 2 5
3 2 3
2 5 7
3 5 3