Tree search algorithm
|
Tree search algorithms are specialized versions of graph search algorithms, which take the properties of trees into account.
Contents |
Algorithms
Search
- Depth-first search
- Breadth-first search
- Best-first search
- A*
- Depth-limited search
- Floyd-Warshall algorithm
- Iterative deepening depth-first search
- Bidirectional search
- Uniform-cost search
Traversal
Related articles
External link
- Gamasutra article reviewing many search algorithms: http://www.gamasutra.com/features/19970801/pathfinding.htm
- Remko Tronçon and Joost Vennekens's JSearch demo applet (http://www.cs.kuleuven.ac.be/~remko/jsearchdemo/): demonstrates various search algorithms.