This topic : 1 . Breadth first search (BFS) 2. Depth First Search (DFS )

1. Course Title: Algorithm
Course Code: CSE 215

2. Atikur Rahman
163432007
Anupom Shill
163432030
Md Ikram Ullah
163432017
Kamrul Hasan
Akash
163432028
Md Alamin
163432033

3. Breadth first search (BFS)
Depth First Search (DFS )

4. Introduction
Graph Traversal
How it works
Simulation of DFS & BFS

5.  A set of vertices and edges.
1.Directed/Undirected
2.Weighted/Unweighted

6.  Breadth First Search (BFS)
The breadth-first search uses a FIFO queue.
Depth First Search (DFS)
The Depth-first search uses a LIFO Stack.

7. Breadth First Search (BFS)

8. 1.Pick a source vertex S to start.
2.Discover the vertices that are adjacent to S.
Breadth First: Pick each
child of S in turn and
discover their vertices
adjacent to that child.

10. 1

11. 1 3
Step 1

12. 1 3 6

13. 1 3 6 7

14. 1 3 6 7 10

15. 1 3 6 7 10
9

16. 1 3 6 7 10 9
12

17. Simulation of DFS

18. Pre Order
In Order
Post Order

19. Root – Left – Right

20. 1 21

21. 1 2 3 41 2 3

22. 1 2 3 4 5 1 2 3 4 5 6

23. 1 2 3 4 5 6 7 1 2 3 4 5 6 7 8

24.  Left – Root - Right

25. 4 4 3

26. 4 3 5 4 3 5 2

27. 4 3 5 2 1 4 3 5 2 1 7

28. 4 3 5 2 1 7 6
4 3 5 2 1 7 6 8

29. Left – Right – Root

30. 4 4 5

31. 4 5 3 4 5 3 2

32. 4 5 3 2 7 4 5 3 2 7 8

33. 4 5 3 2 7 8 6
1
4 5 3 2 7 8 6