Definitions for breadth-first search
breadth-first search

WiktionaryRate this definition:0.0 / 0 votes

1. breadth-first searchnoun

   a search algorithm that begins at the root node and explores all the neighboring nodes

WikipediaRate this definition:0.0 / 0 votes

1. Breadth-first search

   Breadth-first search (BFS) is an algorithm for searching a tree data structure for a node that satisfies a given property. It starts at the tree root and explores all nodes at the present depth prior to moving on to the nodes at the next depth level. Extra memory, usually a queue, is needed to keep track of the child nodes that were encountered but not yet explored. For example, in a chess endgame a chess engine may build the game tree from the current position by applying all possible moves, and use breadth-first search to find a win position for white. Implicit trees (such as game trees or other problem-solving trees) may be of infinite size; breadth-first search is guaranteed to find a solution node if one exists. In contrast, (plain) depth-first search, which explores the node branch as far as possible before backtracking and expanding other nodes, may get lost in an infinite branch and never make it to the solution node. Iterative deepening depth-first search avoids the latter drawback at the price of exploring the tree's top parts over and over again. On the other hand, both depth-first algorithms get along without extra memory. Breadth-first search can be generalized to graphs, when the start node (sometimes referred to as a 'search key') is explicitly given, and precautions are taken against following a vertex twice. BFS and its application in finding connected components of graphs were invented in 1945 by Konrad Zuse, in his (rejected) Ph.D. thesis on the Plankalkül programming language, but this was not published until 1972. It was reinvented in 1959 by Edward F. Moore, who used it to find the shortest path out of a maze, and later developed by C. Y. Lee into a wire routing algorithm (published 1961).

WikidataRate this definition:0.0 / 0 votes

1. Breadth-first search

   In graph theory, breadth-first search is a strategy for searching in a graph when search is limited to essentially two operations: visit and inspect a node of a graph; gain access to visit the nodes that neighbor the currently visited node. The BFS begins at a root node and inspects all the neighboring nodes. Then for each of those neighbor nodes in turn, it inspects their neighbor nodes which were unvisited, and so on. Compare BFS with the equivalent, but more memory-efficient Iterative deepening depth-first search and contrast with depth-first search.

How to pronounce breadth-first search?

1. Alex

   US English

   David

   US English

   Mark

   US English

   Daniel

   British

   Libby

   British

   Mia

   British

   Karen

   Australian

   Hayley

   Australian

   Natasha

   Australian

   Veena

   Indian

   Priya

   Indian

   Neerja

   Indian

   Zira

   US English

   Oliver

   British

   Wendy

   British

   Fred

   US English

   Tessa

   South African

How to say breadth-first search in sign language?

Numerology

1. Chaldean Numerology

   The numerical value of breadth-first search in Chaldean Numerology is: 6

2. Pythagorean Numerology

   The numerical value of breadth-first search in Pythagorean Numerology is: 4

References

1. ^ Wiktionary
   https://en.wiktionary.org/wiki/Breadth-first_Search
2. ^ Wikipedia
   https://en.wikipedia.org/wiki/Breadth-first_Search
3. ^ Wikidata
   https://www.wikidata.org/w/index.php?search=breadth-first search