- 1 -
1. (5 points) The diagram below shows an intermediate state in the execution of Dinic’s
algorithm with dynamic trees (the tree edges are shown in bold and the costs are written
next to the vertices). Draw the residual graph that corresponds to this flow.
CS 542 – Advanced Data Structures and Algorithms
Quiz 5
Jonathan Turner 4/11/2012
a
b
c
d
s
h
g
f
e
t
1,1 2,2
1
4,4
2,0
2
1
2,2
3,-
3,-
4,0
3,3
6,-
5,-
1,1
3,-
H
2 1
H 1
2
H
3,-
cost
4,-
