Questions tagged [spanning-trees]
The spanning tree of a connected undirected graph G is a tree having all the vertices and some number of edges of G.
The spanning tree of a connected undirected graph G is a tree having all the vertices and some number of edges of G.