Analysis of Algorithms : An Active Learning Approach

160 GRAPH ALGORITHMS

A B

F G

C D E

1

(^2) A B
F G
C D E
1
2
3
■FIGURE 6.6C
Second edge added
■FIGURE 6.6D
Third edge added
A B
F G
C D E
1
2
4 3
A B
F G
C D E
1
2
3
5
4
■FIGURE 6.6E
Fourth edge added
■FIGURE 6.6F
Fifth edge added
A B
F G
C D E
16
2
3
5
4
A B
F G
C D E
1
6
2
3
5
4
■FIGURE 6.6G
A minimum spanning tree
■FIGURE 6.6H
An alternative minimum spanning
tree