Linked from

The 8 pages that link to A* search algorithm, each with the reason it gives.

• Breadth-first searchCompared with: Unlike breadth-first search, it uses goal-directed estimates and can handle weighted costs.

• Dijkstra's algorithmCompared with: It adds goal-directed guidance when only a route to a particular destination is needed.

• Floyd–Warshall algorithmCompared with: A* targets a particular route rather than precomputing distances for every pair.