This preview shows page 1. Sign up to view the full content.
p.339
9.11
Find the maximum flow in the network of Figure 9.79.
Answer:
0
0
0
0
0
2
4
4
4
6
2
2
3
3
3
3
4
4
2
2
1
I
H
G
t
F
E
D
s
C
B
A
p.339
9.15
a. Find a minimum spanning tree for the graph in Figure 9.82
using both Prim's and Kruskal's algorithms.
b. Is this minimum spanning tree unique? Why?
This is the end of the preview. Sign up
to
access the rest of the document.
Unformatted text preview: Answer a: 3 1 1 2 7 2 2 3 4 J I H G F E D C B A They are the same Answer b: This minimum spanning tree is not unique. For example, another minimum spanning tree obtained from Prim’s algorithm is: 3 1 1 2 7 2 2 3 4 J I H G F E D C B A...
View
Full
Document
This note was uploaded on 02/16/2011 for the course CS 136 taught by Professor Yuechen during the Winter '08 term at Zhejiang University.
 Winter '08
 YueChen
 Algorithms

Click to edit the document details