Task: Demonstrate Dijkstra's Algorithm Behavior with Negative Edge Weights

Task: Demonstrate Dijkstra's Algorithm Behavior with Negative Edge Weights: a task in Terminal-Lego-15k (Harbor dataset). Dijkstra's algorithm is a fundamental graph algorithm for finding shortest paths from a source vertex to all other vertices. However, it has a well-known limitation: it does…