DEFINITION
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.

Loading conversations.
Similar or Related Terms
Statistics
231
Characters
42
Words
50.16
Flesch Reading Ease
11.5
Flesch Kincaid Grade