L-4.15: BFS & DFS | Breadth First Search | Depth First Search | Graph Traversing | DAA

[@knowledge_of_computer]

Mene apki video dekh bsc cs clear kiya abd now my msc cs ki exam ke liye apse hi pad rhi hu thanku so much sir ♥️😊 itte easy way me padane ke liye

[@vempatikavya4181]

Why this type of teaching is not found in universities...u r fabolus sir..

[@eiji11282]

u were probably chit chatting when your teacher was teaching this stuff and now you probably have exams in some days'

[@shahidjack373]

@@eiji11282 Not in some days. Exam is over today. 😁 of DSA

[@eiji11282]

@@shahidjack373 ahhh lucky.. i have mine last that is programming and that is on 14 😂😂first time giving offline exams

[@sahirmohammad9027]

@@eiji11282 tum LPU ke ho ryt😂😂😂

[@eiji11282]

@@sahirmohammad9027 thode se miss kr gaye 😂cu ka hoo

[@adarshjhaxiif-1289]

The best part of every lecture is - "Subscribers boht jaroori hai😅❤❤" love you sir

[@LordSarcasticVlogger]

THANK YOU ADARSH ..LOVE U 2

[@strawberryrafi4662]

I'm used to it 😂❤ .Sir is the best toh subscribe toh jaroori hai eh❤

[@CartoonTV257]

Great explanation, but one mistake at 0:50, it should be "Every tree is a graph, but not every graph is a tree."

[@vanshrajkudesia]

True

[@Niteshmaurya1234]

yess

[@CLGBOY]

Fatrue

[@monalishasahoo2941]

Yes yes

[@pritamkumari8547]

Yesss..he has made mistake at this point

[@rakeshgaming1756]

0:51 Every tree is a graph, but not every graph is a tree.

[@lagansardana]

areyy wah wah wah wah yahi bolne ko aya si mein

[@GamAnimeLog]

Sahi bole bhai

[@GamAnimeLog]

Ye galat bata ke confusion create kar raha tha

[@deeps-n5y]

@@GamAnimeLog bro insaan hain.. galti ho sakta hain :) Itna achha quality content mil raha hain .. kaafi hain :)

[@Bruce2207]

Correct

[@Manojkumar-po7yu]

Thank u Sir ❤️ For such a great series of DAA.

[@luckysharmaalways]

Maturity is when you know your life was dfs (one direction one goal) became dfs (multiple directions no goals) 😅😂

[@Sanjaysview]

So either learn one thing at time or learn many things at the same time

[@ronokjahanmithila7487]

😂😂😂....

[@dangerousn]

😂😂 we are intelligent therefore we learn 100 of lessons from one topic 😂😂😂😂😂😂😂😂😂

[@mrpatel4313]

Thank you bhai muje pata chal gya ki m mature hu thank you

[@shubhamshah1710]

But if there is any cycle in graph then dfs will be trapped in infinite loop so you won't be able to reach your So we should make sure we are not repeating any mistakes in our life which had made previously again 😅😅

[@Steal_Gaming-ms5fm]

A big salute to you sir....hats off sir....your way of teaching is incredible.

[@PoojanDoshi-tn5ob]

sort and sweet .. very best video for BFS & DFS... thx..

[@GeetShah_22]

I just want to thank this channel which helped me a lot in my selection as TGT CS in DSSSB ... Thanku sir.. 🙏

[@NakaruHikamuraOP]

Congrats

[@anesp.a913]

After 19 yrs Sir make me clear the concept.. Thanks sir

[@abhijeetardalkar4400]

Main kahani ye hai ki devices multiple hai but email ek hi hai! 😄Thanks a lot!

[@golpokotha4228]

[@falaksuryavanshi3108]

Sir m pass hogyi data structure m..😇 thanku so so so much sir..ap sbse best ho...aapki wjh s kitne bcche success ho jate h .❤or m sbhi ko advice Dena chahti hu pdhna ho toh gate smesher sir s...i can't express my feelings in words..❤️✨god bless u sir..😇ap really hero h hum jse average students k liye😊

[@GateSmashers]

Congratulations

[@basulamichane8312]

The teacher that we all wanted but don't deserved♥️♥️

[@AmnaRizwanUnknown]

All your videos provide a wonderful content 😇

[@utkarshsingh2638]

🎯 Key Takeaways for quick navigation: 00:00 🌐 *Graph traversal involves visiting and exploring vertices in a graph or tree, with focus on visiting and exploring.* 01:54 🚶‍♂️ *Breadth-First Search (BFS) covers levels one by one, while Depth-First Search (DFS) goes towards depth, backtracking when needed.* 03:21 🍴 *BFS example: Visiting a food stall breadth-wise at Marys. DFS example: Choosing a career path and backtracking when faced with a dead end.* 05:17 🔄 *BFS uses a Queue, exploring vertices level by level. DFS uses a Stack, going in-depth and backtracking when necessary.* 10:40 ⏱️ *Both BFS and DFS have a time complexity of Order(V + E), making them crucial for applications like web crawlers, social media, and network analysis.* Made with HARPA AI

[@AnkushChavan-n1k]

Best explanation ever on this algo. Salute boss..❤

[@shubhammohanty724]

Who is here before exam ?🙂

[@payal7819]

Yes bro😂

[@huriarauf189]

Am

[@itssipun9086]

Tomorrow is my exam 🙂

[@rupeshyadav3181]

Me at 4am

[@pranshulvijayvergia4213]

10 baje dekh rha hu, 2 baje exam hai 😂

[@darshanwagh7578]

kalyug ko uski charamsima pe pohchane ka waqt aa gaya he sir..isliye ye sikh raha hoon...ASUR

[@shreyabhattacharya74]

Wonderful content sir 😍😍, really helpful for quick remembrance

[@gt9579]

Sir At 0:51 there is a correction. It must be every tree is a graph but graph may or may not be a tree.

[@rohitsen7718]

Yes you're correct, I was also wondering why I cant agree with him 😂

[@gullusingh3959]

I have been watching your videos since last week.

[@sakoon_e_qalb7]

Thank you Soo much sir ,ap bht acha smjaty ha ,concept clear ho jaty ha sary🌸🌸

[@hackcodesfree9200]

i have exam in two days your videos are helping me a lot by saving my time love you brother

[@mddilshadansari_0792]

kaisa gya exam bhai

[@hackcodesfree9200]

@@mddilshadansari_0792 50/60

[@novagames5719]

​@@hackcodesfree9200 which University give results in one month bro

[@Google_cloud_learner]

life saver video , just amazing

[@vismayavr7241]

Super explanation sir... Great teacher

[@lakshayiiitm]

Hey, you are doing a great job.

[@sciencist]

Amazing Explaination sir!!

[@RenuT-g4p]

Thanks you so much for a great lecture.

[@debasmithmohanty2538]

Thanku sir Full course done

[@susenakodumuri2667]

Awesome lecture sir....🙏🙏

[@krishnaradhey2814]

SIR please complete your DAA playlist with the topics like RED-BLACK TREE, B-TREE,TRIES,SKIP LIST, FIBONACCI HEAPS ,ET-CETERA

[@sprite8344]

Lmao stfu go listen while your teacher is explaining in class cringe 🤣🤣🤣

[@sakshiattri6118]

your teaching style is mesmerizing sir😊

[@sakshiattri6118]

Big fan of your teaching style

[@parmaryash5237]

Best video sir❤❤

[@varadacharya2802]

sir can you please also include topics in your DAA playlist like segment tree,red black tree,skip list etc

[@BhupinderKaur-vg2mc]

Teachers like you deserves to be in colleges ....

[@CK_Wiings]

You are teaching on White board is really nice , i thing this little bit .....

[@muhammadshoaibms862]

Such A Great Teacher Hats off💯💯Sir❤❣

[@SocialAnalytics-lc4fd]

kmall sir level great teaching method

[@akashpandey4677]

I ALWAYS SUBSCRIBE very good purpose youtube channel ... like you

[@akashraghu1c113]

You are the great teacher my university teacher is nothing infront of u guruji🙏

[@NadiaKanwal-mm6zp]

Thank you sir Allah ap ko ilm ata Kara mazeed

[@S_eunbi]

Well explained Sir you are the best

[@codewithadii]

tomorrow is my exam and you helped me alot ❤

[@sumansy18]

Exam is in afternoon, I'm watching this in morning 😁

[@SabbirAhmed-si9yt]

just wanted to let you know that ,youre videos are getting suggested by the faculty of our university for better understanding!

[@shivampandyajani]

honest reaction- "Dil khush kar ditta!"

[@ShaikSameer-hn9ui]

Totally loved it maan❤

[@laibaharoon4636]

Sir you are great

[@jaskamalkaur5343]

Thanku so much sir 😊

[@royalsinghrajpoot4646]

Thanks crystal clear🎉🎉🎉❤

[@avnishrai4041]

Level sabke niklenge

[@pandoraowl7379]

Par nikllenge usi ke jo khara rahega

[@devanandkr4055]

😅😅😅😅😅😅😅​@@pandoraowl7379

[@InzaJoiya]

You are just superb

[@arunimachakraborty1175]

Excellent explanation sir. Thank you

[@WhoKnows-s4z]

i dont know you will saw this messege or not hope it will find you. tomorrow is my exam i covered my all topics from watching your video. thanks a lot brother how short how tricky and easy your teaching style i loved it. love from bangladesh. Long live enough. I think still thank you shuldnet be enough the help you did by uploading this video. again thanks a lot

[@Ms.psychology]

Marvelous 👍

[@sigmaftw5042]

Bro is better than IITM teachers

[@mdsabbiralshafi8152]

u r awesome guru. Love u

[@DevHirani-b9v]

very nicely explained

[@Ruby..R]

Finally I finished the playlist sir. Thank you

[@krishnabtech4766]

Exam in 10 hours 😅.. Bharthi Vidyapeeth students (mumbai)appear here ❤

[@mchaudhary120]

Thank you sir 🥰

[@Hacker2004-l9y]

Bloody sweet sirr🎉❤

[@ashishtyagi6152]

Wow amazing 😌😌

[@shubhamdas6519]

thanks a lot sir......

[@iamgirraj]

0:51 time - correct statement is every tree is a graph but not every graphs is tree.😢

[@vlogfrommoon]

EVERY TREE IS A GRAPH BUT EVERY GRAPH MAY OR MAY NOT BE A TREE

[@vedant6460]

great

[@AnupSingh92148]

Love you Sir

[@MrzafiOfficial]

kamal ha sir ji lub u

[@BrainGamesChallenge]

Sir you are great thank you soo muchhh❤

[@ssndas5833]

Thanks sir respect from pakistan ❤❤❤❤❤❤

[@vatsalspatel007]

0:56 according to me there is statement like Every Tree is graph but not all graph is tree

[@Natural.168]

yes it’s correct

[@achieversgyanfamily]

Best of Luck for Tomorrow Exam...😎😂

[@animesh06]

Nice

[@indiankitchen5215]

Kl mera paper H. I hope ye vedio mere kaam aaye

[@DevSingh-xs9ey]

Nice video sir !!

[@Chhanendrasahu88]

thanks sir

[@dimple-raj15]

You are Great sir

[@nextleveltech267]

Thank you so much sir 🙏❤️

[@bhatsabreena9141]

Sir I hope you are well, I like you very much you are one of the best teachers in the world who teaches very well and you make every point very clear, sir you helped me a lot from ist sem to now 4th sem i am doing BCA, For which I am very grateful to you I have watched your all videos till now... Now sir plz i have request please make the video on *Amortized Analysis* and also on *Medians and order statistics*...( bht se youtubers ki vedio dekhi the but zara b smj nahi aaya, kyun ki aph ki aadat hogyi hai na sune ki so plzzz Sir Accept my little request that will be your kindness..lots of love sir ❣️❣️❣️❣️

[@sakibuzzamansakib274]

BEST TEACHER

[@duckworth_lewis]

Here before 1 hr exam

[@AryanKumarBaghel-cp1jv]

How was your exam?

[@creativecode5693]

Bca 😂

[@duckworth_lewis]

@@AryanKumarBaghel-cp1jv got 70 for 100🤣

[@gamerwhale295]

same

[@destinationsuccess3362]

I Also

[@rishitabiswas8533]

Every tree is a graph, but not every graph is a tree.

[@muhammaddaanyal1092]

please make a video on " Chain Matrix Multiplication-Dynamic Programming Formulation "

[@PakWeekly]

Love you Sir from abbottabad kpk Pakistan 😍❤️❤️❤️

[@rdrahuldhiman19]

I think there's a small problem in dry run, from 4 how we can directly jump to 3? 4 has 2 children - 5 and 6. From 4 it's not possible to jump to 3, since 4 doesn't know 3. In my dry run, I had jump to 2, then to 1, then from 1 to 3 and finally 7. Hence, the final answer is same. I'm watching this while I'm learning BST, so maybe I'm wrong, but yeah this is what I had to say.

[@divyam5935]

no u r correct, i was about to comment the same 👍

[@anujmore7701]

Please complete daa syllabus before January

[@JagdishGodara-cq4lr]

really you are great sir

[@mohitkaushik21]

Thanks sir 😊

[@TueestyyFrog]

Love you hogya g

[@directsupport1139]

sir every tree is a graph but not all graph are trees 0:52

[@shubham3438]

Life saviour

[@Prathem1]

Too good👍

[@playtune9217]

The correct statement is: "Every tree is a graph, but not every graph is a tree". you mentioned it wrong in this video

[@sscode3809]

Your teaching technique is very imagine sir👍👍💯💯❣️

[@ranajyoti99]

Super sir

[@puran1075]

Kl paper hai.... Thanks for explaining

[@devilyt214]

00:02 Graph Traversal Methods 01:48 BFS follows all the levels one by one and DFS goes towards depth 03:22 BFS is a breadth-first search algorithm that explores nodes level by level. 04:39 BFS traversal explores nodes in a breadth-first manner. 05:56 BFS traversal works level by level. 07:18 Exploring the options and backtracking 08:36 Backtracking from 5 to 4 and then finding options 09:55 Depth-First Search (DFS) and Breadth-First Search (BFS) have the same time complexity

[@NinjaCoders]

awesome Example

[@sheikhraisulislam4483]

awesome sir