Editing List of algorithms (section)

====Graph search====
{{further|State space search|Graph search algorithm}}
* [[A* search algorithm|A*]]: special case of best-first search that uses heuristics to improve speed
* [[B*]]: a best-first graph search algorithm that finds the least-cost path from a given initial node to any goal node (out of one or more possible goals)
* [[Backtracking]]: abandons partial solutions when they are found not to satisfy a complete solution
* [[Beam search]]: is a heuristic search algorithm that is an optimization of [[best-first search]] that reduces its memory requirement
* [[Beam stack search]]: integrates backtracking with [[beam search]]
* [[Best-first search]]: traverses a graph in the order of likely importance using a [[priority queue]]
* [[Bidirectional search]]: find the shortest path from an initial vertex to a goal vertex in a directed graph
* [[Breadth-first search]]: traverses a graph level by level
* [[Brute-force search]]: an exhaustive and reliable search method, but computationally inefficient in many applications
* [[D*]]: an [[incremental heuristic search]] algorithm
* [[Depth-first search]]: traverses a graph branch by branch
* [[Dijkstra's algorithm]]: a special case of A* for which no heuristic function is used
* [[General Problem Solver]]: a seminal theorem-proving algorithm intended to work as a universal problem solver machine.
* [[Iterative deepening depth-first search]] (IDDFS): a state space search strategy
* [[Jump point search]]: an optimization to A* which may reduce computation time by an order of magnitude using further heuristics
* [[Lexicographic breadth-first search]] (also known as Lex-BFS): a linear time algorithm for ordering the vertices of a graph
* [[Uniform-cost search]]: a [[Tree traversal|tree search]] that finds the lowest-cost route where costs vary
* [[SSS*]]: state space search traversing a game tree in a best-first fashion similar to that of the A* search algorithm