Bfs new
Download as PPTX, PDF0 likes274 views
BFS uses a queue to perform a traversal of a graph, visiting all adjacent unvisited vertices of the vertex at the front of the queue and adding them to the queue. This produces a spanning tree without loops as the final result, where each vertex in the graph can be reached from the starting vertex without cycles. The queue, which has a maximum size of the total number of vertices, ensures a breadth-first search where all vertices at each level are explored before moving to the next level out.
1 of 14
Download to read offline
Bfs new
- 1. BFS (Breadth First Search)
- 2. BFS traversal of a graph produces a spanning tree as final result. Spanning Tree is a graph without loops. We use Queue data structure with maximum size of total number of vertices in the graph to implement BFS traversal.
- 3. Step 1 - Define a Queue of size total number of vertices in the graph. Step 2 - Select any vertex as starting point for traversal. Visit that vertex and insert it into the Queue. Step 3 - Visit all the non-visited adjacent vertices of the vertex which is at front of the Queue and insert them into the Queue. Step 4 - When there is no new vertex to be visited from the vertex which is at front of the Queue then delete that vertex. Step 5 - Repeat steps 3 and 4 until queue becomes empty. Step 6 -When queue becomes empty, then produce final spanning tree by removing unused edges from the graph Traversal Steps
- 14. Thank You