Question: Which of the following is NOT a limitation of Dijkstra\'s algorithm?

Options:

1. It cannot handle negative weight edges
2. It is not suitable for dense graphs
3. It finds the shortest path from a single source
4. It can be inefficient for large graphs

Correct Answer: It finds the shortest path from a single source

Solution:

Dijkstra\'s algorithm is designed to find the shortest path from a single source to all other nodes, which is one of its primary functions.