Breadth First Search | Also & Example | Graph traversal | Data Structures | Lec-51 | Bhanu Priya

breadth first search graph traversal algorithm with example

[@lealembirhanu1678]

This tube channel is all best explained and well organized ever
Thank you so much mam🙏

[@wais4148]

Best explanation !
Thank you so much 🙏🏻

[@suryasvibe1941]

I will always be grateful for your help maam❤ thank you for making difficult topics simple to understand

[@BikashDas-lh9el]

Thank you mam for your lovely guidance

[@pawanprasanna7]

👍Super ka neega teach pandrathu nallavae purithu ka💯 Tq❤️

[@dumbguy1073]

I dont why they introduced these dfs and bfs concepts..i find them useless while calculating and trying to get output!

[@abhishektthakurr]

i saw this video before my DS exam 1 year ago and i had failed , now I'm reappearing DS exam and watching this video again.
wish me luck🙏🤣

[@tusharthakur3800]

passed bro?

[@GauravThakur-hz3zi]

passed??

[@udayreddy923]

Thank you medam give me a good lesson

[@pragatisrivatava5879]

Thanks mam.. This is really very helpfull.

[@babjssk]

Thanku very much
I can not explain you that how it is useful for me
Thnku

[@kushaliediga1020]

Amazing videos understood easily....

[@sanjayijju4996]

very simple explaination great

[@pavansaik5562]

Best explanation 👍👏👏

[@Rohit_editz221]

Thank you so much Mam very nice explanation

[@KomalJadhav-ev7dh]

Nice explanation. Thank you mam

[@AKASHKUMAR-zx4sc]

Thanks great video

[@c.ramanji2604]

Nice explanation mam🤗
....tq so much❤️....so many vedis I watched....but get clarity with this

[@kushaliediga1020]

Thank you bhanu priya.mam

[@vardhamanbhavani7681]

Madam your teaching is very super

[@TravellingSoldier]

Excellent classes...🌼🌼

[@SaravananSaravanan-jw7sl]

Tq..nalla..purithu

[@jayasree3314]

Tnq so much mam for gud explanation

[@pavitraprakash1715]

Good class..thankyouh

[@lavanyachandrika7799]

Thank you, mam!

[@sowndarya6744]

I think in the final spanning tree, f and G should have connecting edge and not C and g

[@achyutkumarsingh7308]

thank you so much

[@rohitkunta8328]

Detailed and good explanation 👌👌

[@amitbharti3644]

Thanks sir

[@upendrareddy1648]

Sem pass madam👩 thank you so much❤😊

[@makineediveeranagendra7621]

Thank you madam

[@mohammedabdul8034]

Thanku so much madam

[@ganeshkurva9791]

Good explanation

[@husnainasdi194]

Thanxs madam

[@yovanraja5792]

Vera leval😍

[@shrinjoyguru7078]

Thank you mam

[@kajaldalai25309]

Thanks 😊

[@5d8vamshiyaradeshi58]

Thanks mam

[@Janakiram_999]

Super madam

[@oneIT-69]

mam, can we get different spanning tress in the result
as i am not getting the spanning tree as yours

[@abhijeetjain2098]

yes!! vanit different spanning is also possible //

[@CSEconceptswithParinita]

Yes, we can!

[@meenuawasthi1335]

Yes

[@aparnaap1015]

Good class

[@Manoj_Max]

What is the output for this mam??

[@vsa_0233]

super mam

[@allamsriram4366]

Tq madam

[@creativechhora4108]

Very helpful vdo ma'am ❤️
Jai shree Ram 🚩
Love from Rajasthan 🧡

[@rohitbharti9360]

thanku mam

[@kratisahai2635]

After A, do we have to insert in d same order D E B..or can we also write B E D?

[@sOURAVRana2001]

Any order

[@SurajKumar-nl3pt]

How you decide final path

[@cs_soldier5292]

Make a video n Red Black Trees please...

[@anirbanhait5998]

Best

[@aditichand9345]

Can't you provide notes of this video.. as it is tough to take ss

[@avutapallihemanth9906]

👋👍👋🙏

[@RupeshKumar-lo5qr]

if ,start from A then we have three unvisited vertex they are D,B, E so can i put B,E,D or D,B,E and more order in the queue

[@devarapallisrilakshmi8445]

You may visit in any way th-cam.com/video/T1doWM6S0BQ/w-d-xo.html check here BFS is there if you like please subscribe to this channel

[@RupeshKumar-lo5qr]

Thanks ma'am

[@mr_noob6361]

@@devarapallisrilakshmi8445 mam at last when we are finding spanning tree how to find that ..mam in the sequence order whichever we get from traversal technique 🥲plz reply 🙏🙏

[@abhishekbhadoriya2465]

Example starts from 2:50

[@pratikdeshmukh3532]

I am reading this comment at 2:49 🥲

[@fevenmasresha3491]

😊😘😘

[@zinnurovArt5233]

Thanks for a video. But i still confused of actual traversal. Which should i use (left-to right or right-to left lookup).Some websites shows differently. Does the alhabetical order matters?

[@MrGamer-sm7lh]

No it does not matter

[@SaumyaVerma-ml4wq]

ye final spanning tree kese nikala mam

[@Ary2345]

For all those who are saying you should visit nodes that are on yhe same level, you should see we are taking graphs and they are so messed up ( like the edges are intertwined) not trees. This is what edges are telling us. The levels. All the edges arising from the same node , means that the resulting nodes will have same level.

[@professionalprasanth1246]

Madam... Do more videos on Data structures ,Operating System , OOPS (without c++) and Discreate maths

[@ankitjaiswal9411]

But as per Bfs firstly visit the vertex that are on same level then go on the next level

[@razin3099]

Seminar kitty guyzzz

[@Lilyofc]

😂😂

[@ganeshkurva9791]

Mam

[@rahulmittal72]

its algorithm not olgarithm

[@razin3099]

💔

[@subhojeetbera8649]

Final output to nikal lo

[@hanuman1414]

Oyy bhanu Priya . I love you as teacher . Crush as teacher 😍😎

[@anshulshivhare5611]

Mdm kbhi hindi bhi bol liya kro thodi

[@vijaykreddyg3211]

Thank u madam