Question 1 Draw the residual network obtained from this flow. Question2 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. Question 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.

Operations Research : Applications and Algorithms
4th Edition
ISBN:9780534380588
Author:Wayne L. Winston
Publisher:Wayne L. Winston
Chapter8: Network Models
Section8.3: Maximum-flow Problems
Problem 11P
icon
Related questions
Question

Question 1
Draw the residual network obtained from this flow.

Question2
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.

Question 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:
4/14
b
d
0/13
4/4
4/9
S
12/16 0/4
8/20
12/12
a
0/7
C
t
Transcribed Image Text:Consider the following directed network with flows written as the first number and edge capacity as the second on each edge: 4/14 b d 0/13 4/4 4/9 S 12/16 0/4 8/20 12/12 a 0/7 C t
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 1 images

Blurred answer
Knowledge Booster
Maximum Flow
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Operations Research : Applications and Algorithms
Operations Research : Applications and Algorithms
Computer Science
ISBN:
9780534380588
Author:
Wayne L. Winston
Publisher:
Brooks Cole