2.a) Breadth First Search || Bfs || Graph traversals

In this video on graph data structure, I have discussed about breadth first search i.e bfs, which is traversing the graph like level order traversal, covering the nodes which are at distance 0, then distance 1 then distance 2 and so on from the source node.

The algorithm used is, we maintain a queue, we visit a node, then add the unvisited neighbours in the queue, till the queue is not empty.

Practice questions:

I hope you liked my video, do subscribe to my channel to get the updates of my latest uploads.

#graph #datastructure #algorithm #interviewquestions #placement #internship #faang

[tecHSonic]

Thanks for the video. At 12:31 it should be bool not int.

[महात्मा-गांधी-असली-वाले]

bhai bullet koi chori kr k le ja rha hai

[jaskiratsinghosahan]

You are doing awesome work.
Plz keep making content for us.
Your channel will grow exponentially 👍👍👍