Goal: Implement a shortest-path finder on a 2D grid using Dijkstra's algorithm.
Goal: Implement a shortest-path finder on a 2D grid using Dijkstra's algorithm.: a task in termgrade-bandcentral-gemma4-31b-bash: TermGrade Band-Central: the 151-task selection and its splits (Harbor dataset). You are given a directory /data containing: - grid.txt : A rectangular grid of…
The task
You are given a directory `/data` containing: - `grid.txt`: A rectangular grid of non-negative integers (space-separated, one row per line). Each integer is the cost to enter that cell. The grid is at most 100x100. - `starts.txt`: One or more start coordinates, one per line, format `row,col`. 0-indexed. -…