Rules of Dijkstra’s game

The abstracted rules are as follows: 

• Every time that we set out to visit a new node, we will choose the node with the smallest known distance/cost to visit first. 
• Once we’ve moved to the node we’re going to visit, we will check each of its neighboring nodes. 
• For each neighboring Node, we’ll calculate the Distance/Cost by summing the cost of the edges that lead to the Node we’re checking.
• Finally, if the distance/cost to a node is less than a known distance, we’ll update the shortest distance that we have on file for that vertex.