Online Computer Dictionary
Browse words
|
Based on
FOLDOC
Queried for: breadth-first search
Definition:
A graph search algorithm which tries all one-step extensions of current paths before trying larger extensions. This requires all current paths to be kept in memory simultaneously, or at least their end points.
Opposite of depth-first search. See also best first search.
Browse through top 20 categories or see more ...
- programming (659)
- application (76)
- networking (823)
- language (1034)
- operating_system (420)
- mathematics (228)
- graphics (155)
- compiler (21)
- library (41)
- World-Wide_Web (133)
- cryptography (36)
- database (166)
- algorithm (132)
- logic (61)
- software (72)
- audio (27)
- virtual_reality (10)
- communications (329)
- file system (28)
- filename_extension (25)