spanning tree


spanning tree

[′span·iŋ ‚trē] (mathematics) A spanning tree of a graph G is a subgraph of G which is a tree and which includes all the vertices in G.