홈 > Term: breadth-first 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.
0
작성자
- Kevin Bowles
- 50% positive feedback