A planar graph and its minimum spanning tree. Each edge is labeled with its weight, which here is roughly proportional to its length. A minimum spanning tree (MST) or minimum weight spanning tree is a subset of the edges of a connected, edge-weighted undirected graph that connects all the vertices together, without any cycles and with the minimum possible total edge weight.[1] That is, it is a spa
![Minimum spanning tree - Wikipedia](https://cdn-ak-scissors.b.st-hatena.com/image/square/09592211df3e6067bf62eb23a93eadce7e14bc19/height=288;version=1;width=512/https%3A%2F%2Fupload.wikimedia.org%2Fwikipedia%2Fcommons%2Fthumb%2Fd%2Fd2%2FMinimum_spanning_tree.svg%2F1200px-Minimum_spanning_tree.svg.png)