Answer Happy

Consider the following flow network with link capacities 1 and flows f. The source node is s = 0, and the terminating node ist = 7. C=4 C=4 f=1 f=3 0 C=3 c=2 7 f=1 4 c=2 f=2 23 f=0 f=0 C=3 f=30=3 f=0 (3曼 f=3 C=1 6 C=3 c=2 f=1 6 (a) List the nodes of the augmenting path p: (e.g., the form of the path would look like this: p= <0, 2, 5, 7>) (b) What is the d amount of flow that can be pushed along the augmenting path p? (c) The following table has the flow values f of each link. In the table, show the new flow values f' after a ð flow is pushed through the augmenting path. For pairs of nodes {u, v} that have two directed links between them, push as much flow as possible on the forward link, then push whatever remaining flow there is on the reverse link. Capacity Current flow f 1 New flow f 4 3 3 1 4 1 1 NA OR 2 Links (0,1) (0,2) (0,3) (1,4) (2,5) (2,6) (3,4) (3,6) (4,7) (5,7) (6,3) (6,7) 3 3 3 2 N 1 wNWNW 2 3 2 0 2 0 1 | فرا نیا 3 3