Alpha-beta pruning A* B* Beam Bellman–Ford algorithm Best-first Bidirectional Breadth-first D* Depth-first Depth-limited Dijkstra's algorithm Floyd–Warshall algorithm Hill climbing Iterative deepening depth-first Johnson's algorithm Lexicographic breadth-first Uniform-cost more
ru:Шаблон:Алгоритмы поиска на графах