Bfs algorithm & its application. Breadth-first search (BFS) is an algorithm for traversing or searching tree or graph data structures. It starts at the tree root (or some arbitrary node of a graph, sometimes referred to as a 'search key'[1]) and explores the neighbor nodes first, before moving to the next level neighbors. BFS and its application in finding connected components of graphs were invented in 1945 by Konrad Zuse, in his (rejected) Ph.D. thesis on the Plankalkül programming language, but this was not published until 1972.[2] It was reinvented in 1959 by E. F. Moore, who used it to find the shortest path out of a maze,[3][4] and discovered independently by C. Y. Lee as a wire routing algorithm (published 1961).[5][6]

1. Welcome to our
presentation
Our Presentation topic Breadth-First Search

2. Index
• INTRODUCTION
How it works
• Time and space complexity
• Application
Social Networking Websites
Finding Shortest Path
Cycle detection
Web Crawlers
Spanning Tree
GPS Navigation systems
Peer to peer network

3. INTRODUCTION
What is Breadth First Search?
Inventor
Invention History

4. HOW IT WORKS
Graph Tree

5. Time and space complexity
• The time complexity can be expressed as {O(|V|+|E|)}
• {O(|E|)} may vary between {O(1)} and {O(|V|^{2})}
• Space complexity for adjacency list is {O(|V|+|E|)}
• Space complexity for adjacency Matrix is {O(|V|^{2})}

6. Application of Breadth-First Search
Asad
Mizan
Rakib Roky
Robi
Social Networking Websites

7. Application of Breadth-First
Search
1.Finding Shortest Path
2. Cycle detection
3. Web Crawlers

8. Finding Shortest Path

9. Simulation using a directed graph:
0
1
2
3
4
5
The shortest path will be : 0,2,3,4,5

10. Cycle detection

11. Cycle detection :

12. Web Crawlers

13. Web Crawlers:

14. Spanning Tree

15. GPS Navigation systems

16. Peer to Peer network

17. Thank You