Breadth First Search Algorithm

This is one of the important Graph traversal technique. BFS is based on Queue data structure.

Analysis:

The time complexity of BFS using Adjacency list is O(V + E) where V & E are the vertices and edges of the graph respectively.

[NippyWolf]

I have seen alot of videos about this subject, but you video is by far the most simple and most clear explanation. Also liked your DFS video. Thank you!

[tjfirhfjejUTH]

great video. accent didn't phase me at all stop complaining people this is free information! be thankful

[gogateiit]

Thanks Anny :) Please share "Breakfast Search" with your friends and keep watching.

[ammarseud]

Watched on x2 speed with no sound, understood everything. The video is just that good :)

[himanshukashyap]

I LITERALLY GOT SCARED WHEN HE SAID, "THAT'S IT, DONE!". ANYWAYS, IT WAS REALLY HELPFUL, SIMPLE LANGUAGE, EASY TO UNDERSTAND.

[akhilballa]

how can someone dislike this? its ample explanation for this topic .

[AshikAdnanMark]

I missed two classes of BFS and this 4:33 sec tutorial covered it up for me. Thank you!

[sashanknarisipalli]

Wow !! It's really been 10 years and i am watching it now😅

[krlwshu]

I wasted 2 hrs in a lecture trying to make sense of what you explained perfectly in 4 minutes. Thank you.

[liveLifeHappyFull]

The best video so far. Everytime I get confused between DFS and BFS I always come here!! Thank you so much

[emannawaz]

today is my paper of data structure and you clr my all confusion of BFS and a lot sir g

[Monyamu]

Great video, helped me a lot in visualizing the progress of the algorithm. I learned it a tiny differently however, regarding the first step, i don't know if its a mistake here, or not.
A is added to the queue before the loop, (the video starts from here--->)marked as visited, added to the output sequence.
We take A as currently working node (this is the time, when it's removed from the queue, not shown here in the video), then take it's unvisited neighbours, everything else goes as in the video.
If you learned it like this, that might be those declarations before the double loop in the structogram.

[aditinarware]

Very well explained, both DFS and BFS. Simple and clear!

[Zinic_]

Another way to look at it: Start with A. One step away from A is B and S. Two steps away from A is C and G. Three steps away from A is D E F H.

[deejay]

Thank you so much! This and your Depth-first search video have been very helpful and easy to understand. In fact I'd prefer these over my school notes!

[iamusmanshabbir]

Best simple easy graphical representation i'was looking for

[yanivgardi]

thanks. it's a good video, but i think it's worth mentioning that when running a BFS starting from vertex A, you actually create a Tree structure (sub-set of the edges), with a root A, that connects all vertexes in the graph to vertex A with the shortest path

[AkhilKumar]

Useful..need more videos please....great channel :-D thanks!

[shashwatkansal]

Very clear, very simple, couldn't have had a better explanation. Thanks a lot!

[craumm]

When you are S, you check A as well, and since it is visited, it is not added on the Queue. You discussed this with E, F and H. Nice video