Kruskal’s algorithm is used to ______
(a) find minimum spanning tree
(b) find single source shortest path
(c) find all pair shortest path algorithm
(d) traverse the graph
The question was posed to me by my college director while I was bunking the class.
This interesting question is from Minimum Spanning Tree in portion Minimum Spanning Tree of Data Structures & Algorithms II