Dijkstra's Algorithm

Dijkstra's Algorithm finds the shortest path from a start node to all other nodes in a graph with non-negative edge weights. On this grid, each move has unit cost.