Breadth-first Search

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:

    You that do search for every purling spring
    Which from the ribs of old Parnassus flows,
    And every flower, not sweet perhaps, which grows
    Near thereabouts into your poesy wring;
    You that do dictionary’s method bring
    Into your rhymes, running in rattling rows;
    Sir Philip Sidney (1554–1586)