Dijkstra's shortest path algorithm (Unweighted)

Counts how many steps it takes to go from one node to another (fastest route).
Doesn't show the path so you will have to extract it from the Dijkstra's adjacency matrix.