| has gloss | eng: The Euclidean minimum spanning tree or EMST is a minimum spanning tree of a set of n points in the plane (or more generally in \BbbR}^d), where the weight of the edge between each pair of points is the distance between those two points. In simpler terms, an EMST connects a set of dots using lines such that the total length of all the lines is minimized and any dot can be reached from any other by following the lines. This is much like a more difficult version of the child's game connect-the-dots. |
