An algorithm for single-link clustering begins with the minimum spanning tree
(MST) for G( 
), which is the proximity graph containing all n(n - 1)/2
edges. Although the single-link hierarchy can be derived from the MST, the MST
cannot be found from a single-link hierarchical clustering.