
126
Complex Networks: An Algorithmic Perspective
p
1
p
2
p
3
p
4
p
5
p
6
p
1
0
√
2 3 5
√
32
√
20
p
2
0
√
5
√
13
√
18
√
10
p
3
0
√
10
√
17
√
17
p
4
0 1
√
5
p
5
0 2
p
6
0
Figure 7.3: Hierarchical algorithm first iteration
shortest distance between the closest points in all pairs of clusters. The entry for this
distance has a as the lower index and b as the higher index. We update distances to the
new cluster formed by merging these two clusters and then shift rows and columns
of D to prepare it for the next iteration. This process is repeated until we have only
one cluster that contains all of the clusters.
Figures 7.3 through 7.6 display the operation of the AHC
Alg in a