Spanning Tree in Graph Theory

A Spanning Tree of a graph is a subgraph that includes all vertices with the minimum number of edges, forming a tree.

Algorithm