It’s often assumed that Dijkstra’s algorithm, or the A* graph ... as a path finding algorithm, it tries one or more steps in roughly the direction of the destination and selects the shortest ...