HF RL Explorer

Shortest Path Through Required Nodes

Shortest Path Through Required Nodes: a task in Terminal-Lego-15k (Harbor dataset). You are given an undirected weighted graph representing a maze. Your task is to implement an algorithm that finds the shortest path through the graph with the following constraints:

Part of PrimeIntellect/Terminal-Lego-15k.