Consider the graph given below:
Use Kriskal's algorithm to find a minimal spanning tree for the graph. The List of 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
Explanation
Use Kriskal's algorithm to find a minimal spanning tree for the graph. The List of 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
Explanation
