9. Use the Ford-Fulkerson labeling algorithm to find a maximum flow and a minimum cut in...

Transcribed Image Text:

9. Use the Ford-Fulkerson labeling algorithm to find a maximum flow and a minimum cut in the network shown in Figure 13.17 by starting from the current flow shown there. S 49, 49 10, 7 22, 20 D 3,0 5,4 H G Figure 13.17. A network with flow 36,30 17, 13 10, 6 24, 24 12, 3 E 14, 14 35, 35 B 16, 16 34, 34 28, 28 10, 2 F 14,4 C 60, 46 30, 30 T 9. Use the Ford-Fulkerson labeling algorithm to find a maximum flow and a minimum cut in the network shown in Figure 13.17 by starting from the current flow shown there. S 49, 49 10, 7 22, 20 D 3,0 5,4 H G Figure 13.17. A network with flow 36,30 17, 13 10, 6 24, 24 12, 3 E 14, 14 35, 35 B 16, 16 34, 34 28, 28 10, 2 F 14,4 C 60, 46 30, 30 T

Answer rating: 100% (QA)

Maxflow mincut theorem Value of max flow capacity of a min cut Au... View the full answer