Task: Demonstrate the Difference Between BFS and Dijkstra's Algorithm

Task: Demonstrate the Difference Between BFS and Dijkstra's Algorithm: a task in Terminal-Lego-15k (Harbor dataset). A common question in algorithm design is: "Why use Dijkstra's Algorithm if Breadth First Search (BFS) can find shortest paths faster?"