Question

/85 G /20 A /75 E /5 /15 /100 /25 /50 H B /30 /5 /10 F /10 S t /10 /90 C /75 /100 J /25 /10 /75 D /5 a. List the augmenting paths in the order you find them. For each one, state the amount by which you increased flow along the path. (You may not need all rows.) Augmenting path b. State the max flow from s to t in the graph. c. List the edges that comprise a min st-cut of the graph. Flow increased

          /85
G
/20
A
/75
E
/5
/15
/100
/25
/50
H
B
/30
/5
/10
F
/10
S
t
/10
/90
C
/75
/100
J
/25
/10
/75
D
/5
a. List the augmenting paths in the order you find them. For each one, state the amount by
which you increased flow along the path. (You may not need all rows.)
Augmenting path
b. State the max flow from s to t in the graph.
c. List the edges that comprise a min st-cut of the graph.
Flow increased

/85
G
/20
A
/75
E
/5
/15
/100
/25
/50
H
B
/30
/5
/10
F
/10
S
t
/10
/90
C
/75
/100
J
/25
/10
/75
D
/5
a. List the augmenting paths in the order you find them. For each one, state the amount by
which you increased flow along the path. (You may not need all rows.)
Augmenting path
b. State the max flow from s to t in the graph.
c. List the edges that comprise a min st-cut of the graph.
Flow increased

Added by Patrick F.

Computer Science and Information Technology

Trishna Knowledge Systems 2018 Edition

Instant Answer

Solved by Expert Aishwarya Krishnakumar

Step 1

First, let's label the edges with their respective capacities: /85 20 A /75 /5 15 /100 /25 /50 10 B /30 /5 /10 /10 /90 /75 100 /25 10 /75 /5 Now, let's apply the Edmonds-Karp algorithm to find the max flow from s to t. Show more…

Show all steps

Thanks for your feedback!

Use Edmonds-Karp to determine the max flow from s to t in the pictured graph. Assume neighbors are seen in alphabetical order. /85 20 A /75 /5 15 /100 /25 /50 10 B /30 /5 /10 /10 /90 /75 100 /25 10 /75 /5 a. List the augmenting paths in the order you find them. For each one, state the amount by which you increased flow along the path. (You may not need all rows.) Augmenting path Flow increased b. State the max flow from s to t in the graph c. List the edges that comprise a min s,t-cut of the graph