Multiple Choice
Suppose that you are applying the maximal flow algorithm. At some point during the application, you have an arc with the numbers 6 and 3 as shown above in Figure 3d. Which of the following is incorrect?
A) The flow from 4 to 6 can be increased by up to 6 units
B) The original numbers at the end of the arcs must add up to 9
C) A flow of 3 units can go from 5 to 4
D) An additional flow of 9 units can go from 4 to 6
Correct Answer:
Verified
Correct Answer:
Verified
Q51: Which is not a reason for the
Q52: Suppose that you are applying the minimal
Q53: Find the shortest route from node 1
Q54: <img src="https://d2lvgg3v3hfg70.cloudfront.net/TB10310/.jpg" alt=" -In
Q55: In the shortest path algorithm given in
Q56: What is the maximum flow possible from
Q57: In the shortest route problem, backtracking is
Q59: In the shortest route problem, the length
Q60: In the spanning tree algorithm, we try
Q61: <img src="https://d2lvgg3v3hfg70.cloudfront.net/TB10310/.jpg" alt=" -In Figure 3b,