Consider the following flow network. S-V₁-V3- SV₂V/₁ →V₂>t2 5-V2->VG-E 5-22-21-03- G = 12 S 6,6 V1 10,1 7,4 V2 7,7 6,0 3,3 V3 8,5 5,2 V4 5,5 a) Vertex | Flow in V₁ Vz V₂ 611 4 2+3 Flow out ㅋ 3+1 (b) Find an augmenting path: S→ √₂V₁ → Va → Vz →t 3 ? State which edges, on your path, have minimum and maximum flow-capacity. (d) Augment the flow. 5+2 5 (a) Check it is a proper flow, by confirming that the flow out of each internal vertex (v₁,..., V4) equals the flow in. (e) Run the algorithm one more time to find the min-cut, and check that the flow across the cut equals the capacity. Capacity of flow is 15 (12+3)
Consider the following flow network. S-V₁-V3- SV₂V/₁ →V₂>t2 5-V2->VG-E 5-22-21-03- G = 12 S 6,6 V1 10,1 7,4 V2 7,7 6,0 3,3 V3 8,5 5,2 V4 5,5 a) Vertex | Flow in V₁ Vz V₂ 611 4 2+3 Flow out ㅋ 3+1 (b) Find an augmenting path: S→ √₂V₁ → Va → Vz →t 3 ? State which edges, on your path, have minimum and maximum flow-capacity. (d) Augment the flow. 5+2 5 (a) Check it is a proper flow, by confirming that the flow out of each internal vertex (v₁,..., V4) equals the flow in. (e) Run the algorithm one more time to find the min-cut, and check that the flow across the cut equals the capacity. Capacity of flow is 15 (12+3)
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
I tried solving parts a), b), d) and e) (I don't know if they're correct tho) but I'm kind of struggeling to do part c) since I don't really know how to find minimum and maximum flow-capacity.
Transcribed Image Text:Consider the following flow network.
S-V₁-V3 - S-V₂V₁ →V₁ t 2 S
5-V2->VG-E
5-22-21-23-
=
6,6
V1
10,1
V2
7,7
6,0
3,3
V3
5,2
V4
8,5
5,5
a)
Vertex Flow in
V^
611
Vz
V₂
2+3
Flow out
(b) Find an augmenting path · S→ √₂ → Vn → Va → Vz → t (3)
State which edges, on your path, have minimum and maximum flow-capacity.
(d) Augment the flow.
3+1
5+2
(a) Check it is a proper flow, by confirming that the flow out of each internal vertex (v₁, . . . , v4)
equals the flow in.
(e) Run the algorithm one more time to find the min-cut, and check that the flow across the
cut equals the capacity. capacity of flow is 15 (12+3)
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY