A spanning tree of an undirected graph is a tree that includes all the vertices of G with the minimum possible number of edges.
For a disconnected graph, there there is no single tree, but a spanning forest, consisting of a spanning tree of each connected component.
Indices and tables
