🎯 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
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 😅😅
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😊
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
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
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 ❣️❣️❣️❣️
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
The best part of every lecture is - "Subscribers boht jaroori hai😅❤❤" love you sir
THANK YOU ADARSH ..LOVE U 2
I'm used to it 😂❤ .Sir is the best toh subscribe toh jaroori hai eh❤
🎯 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
Why this type of teaching is not found in universities...u r fabolus sir..
u were probably chit chatting when your teacher was teaching this stuff and now you probably have exams in some days'
@@eiji11282 Not in some days. Exam is over today. 😁 of DSA
@@shahidjack373 ahhh lucky.. i have mine last that is programming and that is on 14 😂😂first time giving offline exams
@@eiji11282 tum LPU ke ho ryt😂😂😂
@@sahirmohammad9027 thode se miss kr gaye 😂cu ka hoo
Great explanation, but one mistake at 0:50, it should be "Every tree is a graph, but not every graph is a tree."
True
yess
Fatrue
Yes yes
Yesss..he has made mistake at this point
Thank u Sir ❤️ For such a great series of DAA.
A big salute to you sir....hats off sir....your way of teaching is incredible.
Who is here before exam ?🙂
Yes bro😂
Am
Tomorrow is my exam 🙂
Me at 4am
10 baje dekh rha hu, 2 baje exam hai 😂
0:51 Every tree is a graph, but not every graph is a tree.
areyy wah wah wah wah yahi bolne ko aya si mein
Sahi bole bhai
Ye galat bata ke confusion create kar raha tha
@@GamAnimeLog bro insaan hain.. galti ho sakta hain :) Itna achha quality content mil raha hain .. kaafi hain :)
Correct
sort and sweet .. very best video for BFS & DFS... thx..
I just want to thank this channel which helped me a lot in my selection as TGT CS in DSSSB ...
Thanku sir.. 🙏
Congrats
Maturity is when you know your life was dfs (one direction one goal) became dfs (multiple directions no goals) 😅😂
So either learn one thing at time or learn many things at the same time
😂😂😂....
😂😂 we are intelligent therefore we learn 100 of lessons from one topic 😂😂😂😂😂😂😂😂😂
Thank you bhai muje pata chal gya ki m mature hu thank you
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 😅😅
Main kahani ye hai ki devices multiple hai but email ek hi hai! 😄Thanks a lot!
The teacher that we all wanted but don't deserved♥️♥️
After 19 yrs Sir make me clear the concept.. Thanks sir
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😊
Congratulations
I have been watching your videos since last week.
Best explanation ever on this algo. Salute boss..❤
kalyug ko uski charamsima pe pohchane ka waqt aa gaya he sir..isliye ye sikh raha hoon...ASUR
All your videos provide a wonderful content 😇
Thank you Soo much sir ,ap bht acha smjaty ha ,concept clear ho jaty ha sary🌸🌸
life saver video , just amazing
Hey, you are doing a great job.
Best of Luck for Tomorrow Exam...😎😂
Super explanation sir...
Great teacher
Wonderful content sir 😍😍, really helpful for quick remembrance
your teaching style is mesmerizing sir😊
Big fan of your teaching style
Such A Great Teacher Hats off💯💯Sir❤❣
Awesome lecture sir....🙏🙏
i have exam in two days your videos are helping me a lot by saving my time
love you brother
kaisa gya exam bhai
@@mddilshadansari_0792 50/60
@@hackcodesfree9200 which University give results in one month bro
Amazing Explaination sir!!
Thanku sir
Full course done
Level sabke niklenge
Par nikllenge usi ke jo khara rahega
😅😅😅😅😅😅😅@@pandoraowl7379
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.
Yes you're correct, I was also wondering why I cant agree with him 😂
I ALWAYS SUBSCRIBE very good purpose youtube channel ... like you
Thanks you so much for a great lecture.
Totally loved it maan❤
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
honest reaction- "Dil khush kar ditta!"
Best video sir❤❤
just wanted to let you know that ,youre videos are getting suggested by the faculty of our university for better understanding!
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
You are the great teacher my university teacher is nothing infront of u guruji🙏
Thanku so much sir 😊
Well explained Sir you are the best
You are teaching on White board is really nice , i thing this little bit .....
kmall sir level great teaching method
Finally I finished the playlist sir. Thank you
Thank you sir Allah ap ko ilm ata Kara mazeed
SIR please complete your DAA playlist with the topics like RED-BLACK TREE, B-TREE,TRIES,SKIP LIST, FIBONACCI HEAPS ,ET-CETERA
Lmao stfu go listen while your teacher is explaining in class cringe 🤣🤣🤣
Thanks sir respect from pakistan ❤❤❤❤❤❤
You are just superb
Thank you sir 🥰
u r awesome guru. Love u
tomorrow is my exam and you helped me alot ❤
Exam is in afternoon, I'm watching this in morning 😁
Bro is better than IITM teachers
Thanks crystal clear🎉🎉🎉❤
Here before 1 hr exam
How was your exam?
Bca 😂
@@AryanKumarBaghel-cp1jv got 70 for 100🤣
same
I Also
Bloody sweet sirr🎉❤
Sir you are great
Teachers like you deserves to be in colleges ....
Love you Sir from abbottabad kpk Pakistan 😍❤️❤️❤️
Excellent explanation sir. Thank you
Marvelous 👍
Who is watching this video on 2024 June 😂 from tamilnadu who can't understand the language but understood the concept 😊🎉
Which course did you study?
Wow amazing 😌😌
Who is here before exam
very nicely explained
Thank you so much sir 🙏❤️
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 ❣️❣️❣️❣️
kamal ha sir ji lub u
Love you Sir
BEST TEACHER
sir can you please also include topics in your DAA playlist like segment tree,red black tree,skip list etc
The correct statement is: "Every tree is a graph, but not every graph is a tree". you mentioned it wrong in this video
Nice video sir !!
thanks a lot sir......
thanks sir
really you are great sir
Sir you are great thank you soo muchhh❤
Kl mera paper H. I hope ye vedio mere kaam aaye
Too good👍
You are Great sir
Exam in 10 hours 😅.. Bharthi Vidyapeeth students (mumbai)appear here ❤
Life saviour
Thanks sir 😊
❤❤thank you
Every tree is a graph, but not every graph is a tree.
Became your fan🔥🔥❤️
Kl paper hai.... Thanks for explaining
Thankyou sir ❤
Thank you so much sir
Love you hogya g
Thank you so much
EVERY TREE IS A GRAPH BUT EVERY GRAPH MAY OR MAY NOT BE A TREE
great
thanks😇
Your teaching technique is very imagine sir👍👍💯💯❣️
thanks
Thanku sir❤