Dijkstra $3$ Ways

In Dijkstra's single source shortest path algorithm we maintain a vector bestDistanceTo holding the length of the shortest path we have found so far from the source to each vertex. In each round we take the vertex with smallest bestDistanceTo value that we haven't already explored and relax all of its outgoing edges.