Group Members:
Grant Anderson
Logan Tillman
| N | Elapsed Time (total) | Memory Usage (Megabytes) |
|---|---|---|
| 10 | .0042s | 0.01 |
| 20 | .0048s | 0.038 |
| 50 | .007s | 0.236 |
| 100 | .018s | 0.933 |
| 200 | .054s | 3.729 |
| 500 | .3274s | 21.982 |
| 1000 | 1.3088s | 87.928 |
This project implements a Dijkstra's Algorithm to perform rudimentary path finding on a 2D tile-based map.
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
Cost
[(ROW_0, COL_0), ...]