breadth first search
breadth first search
(algorithm)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.
This article is provided by FOLDOC - Free Online Dictionary of Computing (foldoc.org)
Copyright © 2003-2025 Farlex, Inc
Disclaimer
All content on this website, including dictionary, thesaurus, literature, geography, and other reference data is for informational purposes only. This information should not be considered complete, up to date, and is not intended to be used in place of a visit, consultation, or advice of a legal, medical, or any other professional.