breadth-first search

B b

Transcription

- US Pronunciation
- US IPA

- US Pronunciation
- US IPA

Definitions of breadth-first search words

noun Technical meaning of 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. 1
noun breadth-first search (graph theory) a search algorithm that begins at the root node and explores all the neighboring nodes. 0

See all 2 definitions of breadth-first search

Information block about the term

Parts of speech for Breadth-first search

noun

adjective

verb

adverb

pronoun

preposition

conjunction

determiner

exclamation

Full grammatical hierarchy of Breadth-first search

See also

Matching words

Was this page helpful?

Yes No

Thank you for your feedback! Tell your friends about this page

Tell us why?