A spanning tree of an undirected graph is a subgraph that contains all the vertices of the original graph and is also a tree. In other words, it is a connected, acyclic subgraph of the original graph.
सुखार्थिनः कुतोविद्या नास्ति विद्यार्थिनः सुखम्।
A spanning tree of an undirected graph is a subgraph that contains all the vertices of the original graph and is also a tree. In other words, it is a connected, acyclic subgraph of the original graph.