Home »
MCQs »
Algorithms MCQs
Which of the following problems cannot be solved using Dijkstra's Algorithm?
10. Which of the following problems cannot be solved using Dijkstra's Algorithm?
- Shortest path in a city map
- Optimal network routing
- Handling graphs with negative weight cycles
- Efficient airline route planning
Answer
The correct answer is: C) Handling graphs with negative weight cycles
Explanation
Dijkstra's Algorithm does not work correctly with graphs with negative weight cycles.