Eastern University
Presentation on Breadth First Search (BFS)
 Presented TO
 Tanzim Tamanna Shitu
 Presented By
 Ashik Ahammed Hridoy
 ID: 203400003
1

What is BFS?
 The breadth-first search or BFS algorithm is used to search a tree or graph data structure
for a node that meets a set of criteria. It begins at the root of the tree or graph and
investigates all nodes at the current depth level before moving on to nodes at the next
depth level.
2

Example of BFS:
10
4
1 9
17
12 18
Queue: 10|4|17|1|9|12|18
Results: 10|4|17|1|9|12|18
3

Example of BFS:
10
4
1 9
17
12 18
Queue: 10
Results:
4

Example of BFS:
10
4
1 9
17
12 18
Queue: 4|17
Results: 10
5

Example of BFS:
10
4
1 9
17
12 18
Queue: 17|1|9
Results: 10|4
6

Example of BFS:
10
4
1 9
17
12 18
Queue: 1|9|12|18
Results: 10|4|17
7

Example of BFS:
10
4
1 9
17
12 18
Queue: 9|12|18
Results: 10|4|17|1
8

Example of BFS:
10
4
1 9
17
12 18
Queue: 12|18
Results: 10|4|17|1|9
9

Example of BFS:
10
4
1 9
17
12 18
Queue: 18
Results: 10|4|17|1|9|12
10

Example of BFS:
10
4
1 9
17
12 18
Queue:
Results: 10|4|17|1|9|12|18
11

BFS Using JavaScript: 12

BFS Using JavaScript: 13

BFS Using JavaScript:
Results: 10|4|17|1|9|12|18
14

THANKS EVERYONE!
15