HF RL Explorer

Task: Implement and Compare BFS and Dijkstra's Shortest Path Algorithms

Task: Implement and Compare BFS and Dijkstra's Shortest Path Algorithms: a task in Terminal-Lego-15k (Harbor dataset). Implement both Breadth-First Search (BFS) and Dijkstra's algorithm for finding shortest paths in graphs. Demonstrate the key difference between these algorithms by running them on…

The task

Implement both Breadth-First Search (BFS) and Dijkstra's algorithm for finding shortest paths in graphs. Demonstrate the key difference between these algorithms by running them on both unweighted and weighted graphs.

Part of PrimeIntellect/Terminal-Lego-15k.