Email this page to a friend

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.

< Previous Terms	Terms Containing breadth first search	Next Terms >
Branch Target Buffer branch to Fishkill Brazil BRB bread crumbs	best first search depth-first search	break break-even point breakpoint break statement breath-of-life packet