Implement a shortest-path finder on a 2D grid using Dijkstra's algorithm. The program reads a grid from…
Implement a shortest-path finder on a 2D grid using Dijkstra's algorithm. The program reads a grid from…: a task in TermGrade Environments: 1,004 executable Linux tasks (Harbor dataset). Input format (STDIN): - Line 1: start row start col - Line 2: end row end col - Line 3: rows cols - Next rows…
The task
**Input format (STDIN):** - Line 1: `start_row start_col` - Line 2: `end_row end_col` - Line 3: `rows cols` - Next `rows` lines: space-separated integers representing cell costs (non-negative integers, but may include sentinel values). The value `-1` means the cell is an impassable wall. All other values >= 0 are the…
Part of ai-and/termgrade-environments.