BFS(Breadth First Search) is a graph traversal technique where a node and its neighbors are visited first and then the neighbors of neighbors. In simple terms it traverses level wise from the source. First it traverses level 1 nodes (direct neighbors of source node) and then level 2 nodes (neighbors of neighbors of source node) and so on.
Now, suppose if we have to know at which level all the nodes are at (from source node). Then BFS can be used to determine the level of each node.
Input : Output : Node Level 0 0 1 1 2 1 3 2 4 2 5 2 6 2 7 3 Explanation :
Nodes Level 0 --> 0 1 --> 1 2 --> 1 3 --> 2 4 --> 2 5 --> 2 6 --> 2 7 --> 3
- Minimum cost path from source node to destination node via an intermediate node
- Right sibling of each node in a tree given as array of edges
- Find all reachable nodes from every node present in a given set
- k'th heaviest adjacent node in a graph where each vertex has weight
- Number of loops of size k starting from a specific node
- Count single node isolated sub-graphs in a disconnected graph
- Count the number of nodes at given level in a tree using BFS.
- Find if there is a path of more than k length from a source
- Print all paths from a given source to a destination using BFS
- Print all paths from a given source to a destination
- Number of Walks from source to destination
- Count all possible walks from a source to a destination with exactly k edges
- Multi Source Shortest Path in Unweighted Graph
- Minimum edges to reverse to make path from a source to a destination
- Level Ancestor Problem
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.