A spanning tree is a subset of a connected graph that contains all of the vertices of the graph with minimum number of edges.
A spanning tree is a subset of a connected graph that contains all of the vertices of the graph with minimum number of edges.