Breadth-first search: Difference between revisions

Latest revision as of 22:18, 13 January 2024

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.

INDEX
A
B
C
D
E
F
G
H
I
J
K
L
M
N
O
P
Q
R
S
T
U
V
W
X
Y
Z
0
1
2
3
4
5
6
7
8
9

@@ Line 1: / Line 1: @@
+{{Term
+|Display title=breadth-first search
-{{TermHeader}}
+|Definitions={{Definition
-{{TermSearch}}
+|Num=1
+|Meaning=Search strategy in which the highest layer of a [[decision tree]] is searched  completely before proceeding to the next layer.
-<div class="termentry">
+|Explanation=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. <br/>''See also'' [[depth-first search]].
-  <div class="term">
+}}
-== breadth-first search ==
+}}
-  </div>
-<div class="definition"><div class="short_definition">Search strategy in which the highest layer of a [[decision tree]] is searched  completely before proceeding to the next layer.</div><br/> <div class="paragraph">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. <br/>''See also'' [[depth-first search]].</div><br/> </div>
-</div>
-{{TermIndex}}
-{{TermFooter}}
-[[Category:Terms_B]]