Spanning Tree

A spanning tree is a subset of Graph G, which has all the vertices covered with minimum possible number of edges. Hence, a spanning tree does not have cycles and it cannot be disconnected..

Visit the following resources to learn more:

• Spanning Tree
• CSE373 2020 - Lecture 13 - Minimum Spanning Trees
• CSE373 2020 - Lecture 14 - Minimum Spanning Trees (cont)
• Greedy Algorithms: Minimum Spanning Tree