Dijkstra's Algorithm to find the shortest possible distance between two nodes out of 31, then uses a randomizer algorithm to determine what the actual PATH was. (Like "Go to node 1, then 2, then 3... then 5")
