- A To find the shortest path between two nodes in a weighted graph
- B To find the longest path between two nodes in a weighted graph
- C To find the minimum spanning tree of a graph
- D To find the maximum flow in a network
⚠ Report ✓ Question Verified Copy Link
Q: What is the Kruskal's algorithm used for in graph theory?
Graph
Learn More MCQ Questions from Data Structure Graph