In graph theory, breadth-first search (BFS) is a strategy for searching in a graph when search is limited to essentially two operations: (a) visit and inspect a node of a graph; (b) 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 it with the depth-first search.
Read more about Breadth-first Search: Algorithm, Applications
Famous quotes containing the word search:
“Adolescents are travelers, far from home with no native land, neither children nor adults. They are jet-setters who fly from one country to another with amazing speed. Sometimes they are four years old, an hour later they are twenty-five. They don’t really fit anywhere. There’s a yearning for place, a search for solid ground.”
—Mary Pipher (20th century)