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:
“When a person doesn’t understand something, he feels internal discord: however he doesn’t search for that discord in himself, as he should, but searches outside of himself. Thence a war develops with that which he doesn’t understand.”
—Anton Pavlovich Chekhov (1860–1904)