maxFlow-augPathex - Engineering Exercises 1. In the flow...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
xercises 2. The figure below shows an instance of the max flow Exercises 1. In the flow graph shown below, identify a minimum pacity cut problem, followed by a residual graph for the augmenting path algorithm at an intermediate stage in the computation. Identify the next path that would be selected using shortest path ugmentation and show the residual graph capacity cut. augmentation and show the residual graph obtained when this path is saturated. h e b 4 4 2 6 2 3 2 1 s c t e b f 5 4 3 6 2 1 2 3 The cut with X={s,b,c,d,g} is a min-capacity cut with s c d g i t f 2 2 1 5 2 4 1 2 3 h e b 1 4 2 2 d g 4 2 5 4 3 value 10. Find a max flow that corresponds to this cut. The numbers labeling the edges in the diagram below are s c d g i t f 2 2 1 5 2 4 2 3 1 2 1 3 2 1 Residual Graph 2 3 1 the flow values. The path selected by shortest path augmentation is s,c,e,h,f,t which has capacity 1. h
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 03/03/2010 for the course CSE 541 taught by Professor Buhler during the Spring '09 term at Washington University in St. Louis.

Page1 / 2

maxFlow-augPathex - Engineering Exercises 1. In the flow...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online