mlpack: a scalable c machine learning library

The Euclidean Minimum Spanning Tree problem is widely used in machine learning and data mining applications. Given a set of points in, our task is to compute lowest weight spanning tree in the complete graph on with edge weights given by the Euclidean distance between points. Among other applications, the EMST can be used to compute hierarchical clusterings of data. A single-linkage clustering can be obtained from the EMST by deleting all edges longer than a given cluster length. This technique is also referred to as a Friends-of-Friends clustering in the astronomy literature.