

MCQOPTIONS
Saved Bookmarks
1. |
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 |
Answer» B. | |