Project 04: Path Finding

This project implements a Dijkstra's Algorithm to perform rudimentary path finding on a 2D tile-based map.

Input

TILES_N
TILE_NAME_0	TILE_COST_0
...
TILE_NAME_N-1	TILE_COST_N-1

MAP_ROWS MAP_COLUMNS
TILE_0_0    ...
...

TRAVELER_START_ROW TRAVELER_START_COL
TRAVELER_END_ROW   TRAVELER_END_COL

Output

Cost
[(ROW_0, COL_0), ...]