In BFS, we start with a node. 1) Create a queue and enqueue source into it. Mark source as visited. 2) While queue is not empty, do following a) Dequeue a vertex from queue. Let this be f. b) Print f c) Enqueue all not yet visited adjacent of f and mark them visited.
Below is an example BFS starting from source vertex 1. Note that there can be multple BFSs possible for a graph (even from a particular vertex).
The code here is simplified such that it could be used in competitive coding.
Input: 8 10 0 1 0 2 0 3 0 4 1 5 2 5 3 6 4 6 5 7 6 7 Output: 0 1 2 3 4 5 6 7
This article is contributed by Nikhil Mahendran. If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
- Python Tricks for Competitive Coding
- Why is python best suited for Competitive Coding?
- Tips and Tricks for Competitive Programmers | Set 2 (Language to be used for Competitive Programming)
- What coding habits improve timing in coding contest?
- How can competitive programming help you get a job?
- How to become a master in competitive programming?
- Fast I/O for Competitive Programming
- A competitive programmer's interview
- C++ tricks for competitive programming (for C++ 11)
- Bit Tricks for Competitive Programming
- A Better Way To Approach Competitive Programming
- How to begin with Competitive Programming?
- Python in Competitive Programming
- Some useful C++ tricks for beginners in Competitive Programming
- Fast I/O in Java in Competitive Programming