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.
 
 
 

7 lines
44 B

6 6 1 6
1 2 2
2 3 2
2 4 2
3 5 2
4 5 2
5 6 4