Complete linkage measures the separation between two clusters using the maximum Euclidean distance between points in different clusters. In hierarchical clustering, it repeatedly merges the closest clusters according to this rule. section 3.9
NBA draft clustering
To group first-round NBA draft selections by pick number and average win shares, calculate a Euclidean distance matrix and pass it to base R's hclust() with method = "complete". Plot the result as a dendrogram and use rect.hclust(hc, k = 2) to mark two clusters.
