It’s often assumed that Dijkstra’s algorithm, or the A* graph traversal algorithm is used ... and may skip nearby nodes in order to achieve an overall shorter path between the source and ...