Implement a shortest-path solver for a grid using Dijkstra's algorithm (or A with zero heuristic). The…
Implement a shortest-path solver for a grid using Dijkstra's algorithm (or A with zero heuristic). The…: a task in TermGrade Environments: 1,004 executable Linux tasks (Harbor dataset). Input : A JSON object with the following keys: - grid : a 2D array (list of lists) of integers in the range 0…
The task
**Input**: A JSON object with the following keys: - `grid`: a 2D array (list of lists) of integers in the range [0, 255], representing the cost of stepping onto that cell. The cost is paid when ENTERING the cell. Dimensions: 1 <= rows <= 100, 1 <= cols <= 100. - `start`: a list `[row, col]` representing the starting…
Part of ai-and/termgrade-environments.