2) For a graph, finding its minimum spanning tree is a relatively simple method. Draw all the nodes in the graph first, and connect the vertices in turn from the edge with the least weight. Be careful not to form a loop. The final graph is the minimum spanning tree.