It’s often assumed that Dijkstra’s algorithm, or the A* graph traversal algorithm is ... is probably the A* algorithm (geometric goal directed search), which was developed in 1968 at Stanford ...

The story begins in 1956, when the Dutch computer scientist Edsger Dijkstra ... to reduce any directed graph to a combination of two special cases — DAGs and tight clusters — that were each easy to ...