Embedded Files
A spanning tree is a subset of Graph G, which has all the vertices covered with minimum possible number of edges.Â
Page updated
Report abuse
A spanning tree is a subset of Graph G, which has all the vertices covered with minimum possible number of edges.Â