Science Fair Project Encyclopedia
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
03-10-2013 05:06:04
The contents of this article is licensed from www.wikipedia.org under the GNU Free Documentation License. Click here to see the transparent copy and copyright details
The contents of this article is licensed from www.wikipedia.org under the GNU Free Documentation License. Click here to see the transparent copy and copyright details


