Question: What is the main limitation of Dijkstra\'s algorithm?

Options:

1. It cannot find paths in directed graphs.
2. It cannot handle graphs with cycles.
3. It cannot handle negative weight edges.
4. It is not efficient for large graphs.

Correct Answer: It cannot handle negative weight edges.

Solution:

The main limitation of Dijkstra\'s algorithm is that it cannot handle graphs with negative weight edges, as it may lead to incorrect path calculations.