breadth-first search

Computing Dictionary

breadth-first search definition

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.
(1996-01-05)
The Free On-line Dictionary of Computing, © Denis Howe 2010 http://foldoc.org
Cite This Source
Explore Dictionary.com
Previous Definition: breadth wise
Next Definition: breadth-wise
More from Thesaurus.com
Synonyms and Antonyms for breadth-first search
More from Reference.com
Search for articles containing breadth-first search
Dictionary.com Word FAQs

Dictionary.com presents 366 FAQs, incorporating some of the frequently asked questions from the past with newer queries.

Copyright © 2014 Dictionary.com, LLC. All rights reserved.
  • Please Login or Sign Up to use the Recent Searches feature
FAVORITES
RECENT

;