BFS Simplest C++ 💪
Hello!
Let’s learn one of the best algorithm named as BFS 👼🏻.
It uses a queue to traverse the graph’s nodes. The source node is added to queue and then we start with condition until queue is empty 😎.
So we start popping out the node from the queue until its empty and we also push the non-visited adjacent nodes to the queue of the current node✌️.
To maintain the state of nodes whether they are visited or not we use an array named visited [✍️].
Now let’s have a look at the source code in c++ for the same 💻.
The above code is very easy to understand and implement 🙃. I have added the picture over here, so you would love to code instead of copy 😜 😜.
It’s too easy and you can code it in one go, so the above function takes three arguments as soucre vertex named as start, number of vertices and the adjacency list of the all graph nodes. 🤗
To understant the input see the below screenshot-
Cheers!! 👊
Thank you for reading!📖
Clap if you like it 👏👏
