Breadth-first search

From AMS Glossary
Jump to: navigation, search


breadth-first search

Search strategy in which the highest layer of a decision tree is searched completely before proceeding to the next layer.

In this manner, no viable solution is omitted and the optimal solution is found. This strategy is often not feasible when the search space is large.
See also depth-first search.

Personal tools
Namespaces
Variants