Maximal Flow Problem

(+) (-)
From To On Route Capacity Nodes Net Flow
1 2 7 <= 7 1 54 =
1 3 8 <= 8 2 0 =
1 4 16 <= 17 3 0 =
1 5 8 <= 8 4 0 =
1 6 15 <= 17 5 0 =
2 4 3 <= 3 6 0 =
2 7 4 <= 6 7 0 =
2 5 0 <= 4 8 0 =
3 5 3 <= 6 9 0 =
3 9 0 <= 9 10 -54 =
3 6 5 <= 5
4 7 4 <= 8 Maximum Flow 54
4 10 15 <= 15
5 7 0 <= 6
5 8 7 <= 10
5 9 4 <= 4
6 9 5 <= 7
6 10 15 <= 15
7 10 8 <= 8
8 10 7 <= 7
9 10 9 <= 9
Supply Demand
0
0
0
0
0
0
0
0
0
0