A spanning tree connects all of the nodes in a graph and has no cycles. Below is a graph in which the arcs are labeled with distances between the nodes that they are connecting.

Press the Start button twice on the example below to learn how to find the minimum spanning tree of a graph.