HF RL Explorer

Task: Implement BFS Path Tracing Algorithm

Task: Implement BFS Path Tracing Algorithm: a task in Terminal-Lego-15k (Harbor dataset). Implement a Breadth-First Search (BFS) algorithm in Python that not only finds a target node in a graph but also traces and returns the shortest path from the start node to the target node.

The task

Implement a Breadth-First Search (BFS) algorithm in Python that not only finds a target node in a graph but also traces and returns the shortest path from the start node to the target node.

Part of PrimeIntellect/Terminal-Lego-15k.