Complete this network problem on paper and then answer the Q
Complete this network problem on paper and then answer the Quiz 5 questions (located under the Assignments tab) posted to the course website on Canvas (will be posted soon). The questions posted to the course website on Canvas for this quiz require you to work the problem in a particular order. You may want to first review the questions on the course website on Scholar, then work the quiz on paper to make sure you have the correct answer. Maximal Flow Problem. For the network shown below, determine the maximum flow from source node 1 to destination node 6. Flow capacities for each branch are indicated in the diagram. What is the maximum flow through the network?
Solution
from the diagram we can say the maximum flow is through path 1- 3 - 4 -6
where the flow is 12 + 22 + 34 = 68 ;
if we look at other paths 1-2-4-6 then we have 19 + 14 + 34 = 67 ;
path 1- 4- 6 is 20 + 34 = 54;
from travelling all the paths we can say the maximum flow takes place through path 1- 3 -4-6 which is 68
