Heuristic Graph Search and Pathfinding Algorithms

Algorithms that look for a route or a goal in a graph of positions, usually guided by an estimate of the remaining cost, such as A*, best-first search, beam search, iterative deepening and jump point search. An algorithm belongs here when its cited article calls it a graph search, best-first search or pathfinding algorithm. It excludes searches of a sorted list, which sit in the ordered list group. A member is placed here by what its own cited article states about it, not by the name of the algorithm or by the uses it is put to today, so each entry sits in the group its source describes it as belonging to.