Spanning tree - WikipediaFor the network protocol, see Spanning Tree Protocol. For other uses, see Spanning tree (disambiguation). A spanning tree (blue heavy edges) of a grid graph In the mathematical field of graph theory, a spanning tree T of an undirected graph G is a subgraph that is a tree which includes all of the vertices of G.[1] In general, a graph may have several spanning trees, but a graph that is not connect
