Question: Exercise 7 . 3 , Page 4 1 5 . Figure 1 shows a flow network on which an s - t flow has been

Exercise 7.3, Page 415. Figure 1 shows a flow network on which an s-t flow has been computed.
The capacity of each edge appears as a label next to the edge, and the numbers in boxes give the amount of flow sent on each edge (Edges without boxed numbers have no flow being sent on them).
(a) What is the value of this flow? Is this a maximum s-t flow in this graph?
(b) Find a minimum s-t cut in the flow network pictured in Figure 1, and also say what its capacity is.
Exercise 7 . 3 , Page 4 1 5 . Figure 1 shows a

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!