Breadth First Search is a graph traversal algorithm.
The breadth-first search begins at the root node of the graph and explores all its neighbouring nodes. For each of these nodes, the algorithm again explores its neighbouring nodes. This is continued until the specified element is found or all the nodes are exhausted.
A queue is used as an auxiliary data structure to keep track of the neighbouring nodes.
The worst case occurs when the algorithm has to traverse through all the nodes in the graph. Therefore the sum of the vertices(V) and the edges(E) is the worst-case scenario. This can be expressed as O( |E| + |V| ).
During the traversal, all the nodes at one level must be stored until their child nodes in the next level have been visited. The space complexity is, therefore, the deepest level of the nodes in the graph.
This is a complete algorithm because if there exists a solution, it will be found regardless of the type of graph provided.
- Define a Queue with the size equal to the total number of vertices in the graph.
- Select any vertex as the starting point for traversal. Visit that vertex and insert it into the Queue.
- Visit all the adjacent vertices of the vertex which is in front of the Queue which is not visited and insert them into the Queue.
- When there is no new vertex to visit from the vertex at front of the Queue then delete that vertex from the Queue.
- Repeat step 3 and 4 until the queue becomes empty.
- When the queue becomes Empty, then produce the final spanning tree by removing unused edges from the graph.
- Peer to Peer Networks: In a peer to peer network, all the nodes are required to keep track of its neighbouring nodes. Breadth First Search can be used for this purpose.
- Search Engine Crawlers: Search Engines crawlers keep track of all the pages of the web by maintaining a list of all pages and their neighbours. Using Breadth First Search allows keeping a limit on the depth of the pages traversed by the crawlers.
- Path Finding and GPS Navigation: The path from one point to another point can be found using a Breadth First Search. This is used in GPS navigation systems we use every day.
Breadth First Search: Excellent explanation from MIT OCW