Agglomerative hierarchical clustering by the nearest-neighbour-chain algorithm with Lance–Williams
updates on a full Euclidean distance matrix — O(n²) time and memory (n ≤ 8000). Heights follow scipy's
linkage conventions (Ward: √ of the Lance–Williams update on squared distances).
Agglomerative hierarchical clustering by the nearest-neighbour-chain algorithm with Lance–Williams updates on a full Euclidean distance matrix — O(n²) time and memory (n ≤ 8000). Heights follow scipy's
linkageconventions (Ward: √ of the Lance–Williams update on squared distances).