Search for question
Question

Problem 3 (10 pt.) For each graph below, find the maximum flow from the source node s to the sink node t using the augmenting path algorithm. Identify one s-t cut with the minimum capacity. 17. 6 Problem 3 (1) "1 Problem 3 (2)

Fig: 1