In which scenario is Dijkstra's algorithm not suitable?

In which scenario is Dijkstra's algorithm not suitable?

Step 1: Understand what Dijkstra's algorithm does. It finds 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 Dijkstra's algorithm works well when all edge weights (the cost to travel between nodes) are zero or positive.
Step 4: Learn what negative weights are. They are edge weights that are less than zero, meaning traveling along that edge reduces the total cost.
Step 5: Realize that if a graph has negative weights, Dijkstra's algorithm can make mistakes and give the wrong shortest path.
Step 6: Conclude that Dijkstra's algorithm is not suitable for graphs with negative weights.

No concepts available.