Consider the graph given below :
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 chosen 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
Article Tags :
Recommended Articles