The spanning tree of a graph G is a subgraph of G that has same set of
vertices as G but is a tree. The Minimum spanning tree of a
weighted graph G is a spanning tree of G whose edges sum to the
minimum weight for all spanning trees of G. Greedy algorithms give
optimal solution for minimum spanning trees.