a Spanning Tree of graph 𝐆 is a subset of graph 𝐆, which has all the vertices connected with each other with the minimum possible number of edges

Subpages

• Constrained Minimum Spanning Tree (CMST)
• DFS Spanning Tree (DST)
• Minimum／Maximum Spanning Tree (MST)