and 4 others joined a min ago.
0
7.6kviews
Minimum cost spanning trees-Kruskal and prims algorithm
1 Answer
1
194views
written 6.7 years ago by
teamques10
★ 70k
|
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..
By this definition, we can draw a conclusion that every connected and undirected Graph G has …
and 5 others joined a min ago.
ADD COMMENT
EDIT
Please log in to add an answer.