UGC-NET | UGC-NET CS 2017 Dec 2 | Question 5

Consider the graph given below :
kruskal
Use Kruskal’s algorithm to find a minimal spanning tree for the graph. The List of the edges
of the tree in the order in which they are choosen is ?
(A) AD, AE, AG, GC, GB, BF
(B) GC, GB, BF, GA, AD, AE
(C) GC, AD, GB, GA, BF, AE
(D) AD, AG, GC, AE, GB, BF


Answer: (A) (B) (C) (D)

Explanation:

Quiz of this Question
Please comment below if you find anything wrong in the above post




My Personal Notes arrow_drop_up
Article Tags :

Be the First to upvote.


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.