By Letter: Non-alphabet | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z
  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
bread crumbs
best first search
depth-first search
break-even point
break statement
breath-of-life packet

Web Standards & Support:

Link to and support Powered by LoadedWeb Web Hosting
Valid XHTML 1.0!Valid CSS! FireFox Extensions