Task: Bellman-Ford vs Dijkstra Algorithm Comparison

Task: Bellman-Ford vs Dijkstra Algorithm Comparison: a task in Terminal-Lego-15k (Harbor dataset). Implement both the Bellman-Ford and Dijkstra shortest path algorithms and demonstrate the specific circumstances where Bellman-Ford is the better (or only valid) choice.