Bfs present
Download as PPTX, PDF1 like158 views
Breadth First Search (BFS) is an algorithm for traversing or searching tree and graph data structures by exploring neighboring nodes first before moving to the next level neighbors. It works by assigning levels to nodes starting from the root node as level 0 and then exploring each level in order, marking visited nodes and placing unvisited children in the queue to be explored next.
Related topics:1 of 9
Downloaded 11 times
Bfs present
- 1. Breadth First Search Presented By: Minhaz Uddin ID: 151001612
- 2. BFS Definition: BFS is an algorithm for traversing or searching tree or graph data structures. BFS Algorithm: 1.We pointed start vertice as level zero. 2.Starting from start vertice we visited all the vertices that are at the distance of one edge away. these vertices pointed as level one from the start vertice and mark as visited.
- 3. 3. we again visited all the new vertices that are at the distance of one edge away from the level one. these vertices pointed as level two and mark as visited . 4.The process is continue until all the vertice mark as visited.
- 5. Start vertice : A Output : A Output : A B E Queue B E
- 6. Current vertice: B Output : A B E D Queue E D
- 7. Current vertice: E Output : A B E D C Queue D C
- 8. Current vertice: D Current vertice: C Output : A B E D C Output : A B E D C Queue C Queue
- 9. Output : A B E D C BFS is done Queue