What is the primary limitation of Dijkstra's algorithm?

What is the primary limitation of Dijkstra's algorithm?

Step 1: Understand what Dijkstra's algorithm is. It is a method used to find the shortest path in a graph.
Step 2: Know that a graph is made up of nodes (or points) and edges (or 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 does not work correctly if there are edges with negative weights.
Step 6: Understand that negative weight edges can cause the algorithm to give wrong answers about the shortest path.

No concepts available.