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.
 
 
 

15 lines
101 B

10 14 1 10
1 2 5
2 10 4
1 10 7
1 3 8
3 10 9
1 4 3
4 7 1
7 10 1
1 5 3
5 8 4
8 10 6
1 6 7
6 9 6
9 10 5