Function kodama::mst

pub fn mst<T: Float>(dis: &mut [T], observations: usize) -> Dendrogram<T>

Perform hierarchical clustering using the minimum spanning tree algorithm as described in Müllner's paper.

In general, one should prefer to use linkage, since it tries to pick the fastest algorithm depending on the method supplied.