Which of the following is a limitation of Dijkstra's algorithm?

Which of the following is a limitation of Dijkstra's algorithm?

Step 1: Understand what Dijkstra's algorithm is. It is a method used to find the shortest path from one point to another in a graph.
Step 2: Know that a graph is made up of nodes (points) and edges (connections between points).
Step 3: Recognize that edges can have weights, which represent the cost or distance to travel from one node to another.
Step 4: Learn that Dijkstra's algorithm works well when all edge weights are positive (greater than zero).
Step 5: Identify the limitation: Dijkstra's algorithm cannot correctly handle edges that have negative weights (less than zero).
Step 6: Understand that if a graph has negative weight edges, Dijkstra's algorithm may give incorrect shortest path results.

No concepts available.