It’s often assumed that Dijkstra’s algorithm, or the A* graph traversal algorithm is used, but the reality is that although these pure graph theory algorithms are decidedly influential ...

It can be seen as an extension of Dijkstra’s algorithm. A* achieves better performance by using heuristics to guide its search. Compared to Dijkstra’s algorithm, the A* algorithm only finds the ...