

MCQOPTIONS
Saved Bookmarks
1. |
Dijkstra’s Algorithm is used to solve _____________ problems. |
A. | All pair shortest path |
B. | Single source shortest path |
C. | Network flow |
D. | Sorting |
Answer» C. | |