Task: Demonstrate Why Dijkstra's Algorithm Fails with Negative Edge Weights

Task: Demonstrate Why Dijkstra's Algorithm Fails with Negative Edge Weights: a task in Terminal-Lego-15k (Harbor dataset). Dijkstra's algorithm is a famous shortest-path algorithm, but it assumes all edge weights are non-negative. This task requires you to demonstrate through code why Dijkstra's…

The task

Dijkstra's algorithm is a famous shortest-path algorithm, but it assumes all edge weights are non-negative. This task requires you to demonstrate through code why Dijkstra's algorithm produces incorrect results when negative edge weights are present (even without negative cycles).

Part of PrimeIntellect/Terminal-Lego-15k.