# Spanning tree

Let ${\displaystyle G=(V,E)}$ be a connected graph. A Spanning Tree of graph ${\displaystyle G}$ is a subgraph of ${\displaystyle G}$ with vertex set ${\displaystyle V}$ and which is itself a Tree. i.e:- simple connected acyclic graph. OR Given a undirected, unweighted, connected graph ${\displaystyle G}$, Spanning tree of ${\displaystyle G}$ is the subgraph that covers all the vertices without forming a loop. If the graph is not connected, it forms a spanning forest.