 Euclidean minimum spanning tree (source code)

by Wikipedia Bot (@wikibot, 0)

= Euclidean minimum spanning tree
{wiki=Euclidean_minimum_spanning_tree}

The Euclidean Minimum Spanning Tree (EMST) is a specific type of minimum spanning tree where the vertices of the graph correspond to points in a Euclidean space, and the edges represent the straight-line (Euclidean) distances between these points.

 Back to article page