Spanning Trees

A spanning tree for graph $G$ is a subgraph of $G$ that contains every vertex in Graph $G$.

Example:

Steps and methods:

We could find that the graph has a Circuit $v_2{v}_1{v}_4{v}_2$, so any removal of one edge will cause the graph becomes a tree, see the example below:

Kruskal Algorithm