Consider the following directed network with flows written as the first number and edge capacity as the second on each edge: Part 1 Draw the residual network obtained from this flow. Part 2 Perform two steps of the Ford Fulkerson algorithm on this network, each using the residual graph of the cumulative flow, and the augmenting paths and flow amounts specified below. After each augment, draw two graphs, preferably side by side; these are graphs of: a) The flow values on the edges b) Residual network The augmenting paths and flow amounts are: i) s → b→d c→t with flow amount 7 Units. ii) s → b→ c→ t with 4 units. Note for continuity your second graph should be coming from the one in (i) NOT from the initial graph. Part 3 Exhibit a maximum flow with flow values on the edges, state its value, and exhibit a cut (specified as a set of vertices) with the same value.
Consider the following directed network with flows written as the first number and edge capacity as the second on each edge:
Part 1
Draw the residual network obtained from this flow.
Part 2
Perform two steps of the Ford Fulkerson
i) s → b→d c→t with flow amount 7 Units.
ii) s → b→ c→ t with 4 units.
Note for continuity your second graph should be coming from the one in (i) NOT from the initial graph.
Part 3
Exhibit a maximum flow with flow values on the edges, state its value, and exhibit a cut (specified as a set of vertices) with the same value.
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 6 images
