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!

[@gogateiit]

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

[@brendamoragwa2474]

I learnt a lot in this video. Thank you so much❤

[@tjfirhfjejUTH24]

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

[@holhorse3808]

*WELCOME TO BURGER KING*

[@MohitSharma-xf9wp]

even your accent is also damm horrible

[@ammarseud5461]

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

[@himanshukashyap6336]

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

[@BreakTheBeat852]

Minecraft Steve lookin ass

[@liveLifeHappyFull]

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

[@djjonno91]

breakfast search

[@RedSlim007]

lol

[@ArvindhMani]

+Jonathon Scanes Gotta say, from an Indian point of view, I've heard FAR FAR worse.

[@SuBiBH]

yes please!

[@NwNCq]

Thank you! Now I can't think otherwise..

[@sleeksilve2]

...every morning when I wake up... sometimes noon.

[@akhilballa6838]

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

[@vanreus6150]

Because of the Indian accent

[@EzioOmer]

@@vanreus6150 surhay sen misin aw sadAS:ada

[@vanreus6150]

evet lanhsbsbsa

[@EzioOmer]

@@vanreus6150 sdakjdasjklaskdjas olm path finding bir araştırayım dedim :ASDasads sen çıktın olaya bak

[@deejay5627]

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!

[@aditinarware9843]

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

[@shashwatkansal6786]

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

[@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.

[@yanivgardi9028]

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

[@emannawaz6647]

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

[@AkhilKumar]

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

[@jackchun8767]

Clean and clear explanation, Thank you so much ! Looking forward to see more of your tutorial video :)

[@azzarox6661]

Thanks for the refresher, needed to implement this for an assignment and couldn't remember how. This really helped!

[@FranciscoCostaRamos]

Hey, can you add the d and pi values for each vertice? thanks

[@vixxxwxxxxinghe6624]

Thank you very much ,,, very clear explanation !!!

[@AdamGreenhill]

Thanks man! This + DFS helped!

[@iamusmanshabbir142]

Best simple easy graphical representation i'was looking for

[@krlwshu]

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

[@iamnero9]

Thank you very much! It made a great help for me to understand this one in simpler way.

[@sliq101]

great video , short and very precise

[@ParameswaraReddyBanthikatla]

Best simplest possible explanation. Thank you

[@Mr1Samurai1]

Very clear explanation, thank you.

[@ifoundthewords]

Great explanation and illustration, thank you.

[@Annyv2]

I loved this video, it also made me laugh, I kept hearing "breakfast search" wich made it even more memorable

[@DJBuckCallYo]

Simple and clear explanation, thank you!

[@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.

[@almind2894]

thanks!

[@majdayoub2344]

But what are the complexities of both ways?

[@SCShield]

Breadth-first search and depth-first search are both linear algorithms.

[@10joaaa]

Very clear and simple explanation, thank you.

[@LikeACrouton]

Thanks a lot, very clear explanation.

[@madhupnetfundu]

This is a great video, thank you for uploading !!

[@balamajay834]

This video is very clear and very easy to understand

[@NikoNikomedes]

Very clear and understandable example, thank you very much

[@teeman9266]

Great vid, simple and on point!

[@lokeshbajracharya5190]

AWESOME, you put it so simple.. thanks

[@shyamasishgupta5206]

Thanks For the video. But i have a doubt. If the empty queue is the ending condition for the algorithm, then after Dqueue of 'S', the queue was empty. Why the algorithm didn't stop in that time itself?

[@corecse_AI]

Is it compulsory to visiting adjacent nodes in lexical order?

[@gaboonviper89]

Great explanation, thank you uploading this.

[@VardanSharma]

Getting ABSCGDFEH is it correct?

[@austyncousins4978]

Excellent explanation - thanks!

[@sashanknarisipalli]

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

[@Zebban89]

many thanks for this video! :)

[@sangeethathiru2030]

Why cany we start with B as startin node?

[@vickylance]

I am clearly understanding the algorithm but not able to write a program and also not able to understand the program already writtern by someone else ..... I definitely need a video which explains the algorithm with the help of a program.

[@gustavoturm]

Take a look at Dieter Jungnickel's "Graphs, Networks and Algorithms" and also at Sedgewick's "Algorithms".

[@vickylance]

Gustavo Bandeira
Now I am more into developing Hololens Applications. :)

[@rafvandenbosch5808]

concise and good explanation. Thanks !

[@cs-27]

Thanks a lot!!!!!!!! it's fabulous!!!!!!!!!! It'll be a great help before exams to go through these...........

[@MrPali1]

helpful, but it would be nice to know the path, say, if H was the end node, how do you find the shortest path?

[@yosef5953]

Wow explained very well. Thank you so much.

[@jcx5750]

This was very helpful. Thank you.

[@luc1179]

Absolutely crystal clear!

[@faizmohammadfaqiry5403]

very nice demonstration sir, Thank you ,
it helped me.

[@samuelgosselin5150]

great video thanks for the short length

[@sarvodaykumar2723]

Hello dear teacher could you please add video code on adding and delete new node/ edge in graph

[@Sandeee]

How do u know when to finish?

[@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

[@lowochi]

How would it look if you used a stack?

[@openworld7585]

Thank you for such good video

[@ivanivanov2160]

Very well explained ! Cheers !

[@YocasFilmz]

Thanks for the explanation!

[@johnmassaad7904]

Very helpful, Thank you very much:)

[@fauziafariha8844]

shouldn't we go left to right node from root instead of choosing alphabetically?

[@cryptoanalyst5058]

Very well explained. Thank you

[@JessicaMary0702]

This is so helpful to review for final exams. 😄

[@shaw6781]

awesome explanation man...thz a lot for the upload....

[@madhaviyalagam2158]

Y the node A not enqued into the queue?

[@irenek7291]

This really helped, thankyou!!

[@funbox5292]

Very Informative :) Great work,.. keep it up :)

[@supernalmalang749]

i can understand it very well..... thank you so much

[@CamKnoppMusic]

Great vid. Nice and simple.

[@def__init]

POP IT OFF I love it thank you

[@justincaseOne]

thanks for the effort!

[@kautukraj]

Very helpful, thank you.

[@pavarayaa]

In Breadth First Search (BFS) Algorithm, the search should start from the root node which is in level 0, isn't it? And then goes level by level from left to right.

[@nipuntaunk2842]

That’s a graph not a tree

[@karolinekkk]

Great explanation! to the point!

[@monikasinha379]

Thank u so much sir.....
is there video for algorithm of this ???

[@Afernity]

is it only use for graph traversals, or also directed graph ?

[@bhupeshpant8830]

very helpful and easy as compared to any other technique for BFS.

[@simrannadaf6018]

Tysm 4explaining within short span of time 😊😊

[@timtimtim89]

Awesome video, thanks =D

[@TaraArya92]

Nice Explanation, Thanks you so much....

[@mindormood1]

thanks man, you are awesome!!!!!!

[@sindhuchinniah4363]

Thank you so much. It was helpful.

[@badwaikrohit]

Nice explanation! But if you could add little about the algo's complexity and explain it, then it could have made this very useful.

[@shashikumarlamsal6968]

short but sweet...nice explanation

[@XxhoseinxX]

many thanks to you that was awesome !

[@huzzakawah]

Thank you for the video. Very helpful.

[@swethasj8586]

why cant we take node S first??

[@raghdakhdour3270]

could u tell us how to find the cost ??

[@prafullaraichurkar4369]

Good Explanation, Thanks :)

[@hasibullah3902]

Sir,u totally saved my ass.The book was so freakin confusing,i felt like this shit was out of my grasp.Thanks a lot 😀

[@kautukraj]

Very helpful!

[@GrundGad]

s.o.b !!! I finally understand it !!!!!!!!!! thank you!

[@ishaanmiglani7655]

i m not getting this how can u enqueue and dequeue alphabetically ???? first b and then s ? why not s first and where is front and rear elements .. plzz help i m a rokieeeee

[@jyotilohan7154]

Nice yrr.. This is very useful for me.... Thanku sir

[@johnhurley8918]

Very helpful and succinct.

[@DeepakRaj-dc5vg]

ase hi mehnat krte rho ... gazabb

[@anayaz2934]

your material is very information . i have some questions related to your topic can u plzzz tell me Why BFS take a lot of space than DFS, although their space complexity is same? and why we implement BFS by only using queue?

[@amalsathyan5530]

Thanks really helped ❤️