you know... when ever i search for DFS n bfs example... non of the video example helped me out ... but ur way of explanation is awesome... n whenever i got stuck i just looked for ur video... thank u so much...
@@abhinavtripathi It's mentioned but it isn't clear. "Modified from" does not necessary mean "Credits given to" - it can be easily misunderstood as you've "created" the video by modifying that original video, instead of reuploading it. That's why so many people in the comments still assume "you" are the original creator. If I were you, I would at least change the "modified from" to something clearer to avoid confusion.
A BIG THANKYOU! YOu explained it so clearly!! I regret not finding this video before my actual painful lecture where the prof couldn't explain such a simple thing properly.
So far best explanatory video !!! trust me i have like wasted my 2 hours looking at videos hoping they will give me good info. thank you very much for your explanation.
thanks so much!....i was just not able to understand these 2 traversals after trying so many times.....managed to understand from this in one go!...BRILLIANT n SIMPLE!
Thank you very much, it nelped a lot! You are an inspiriation for making tutorials for other people, who have difficulties with understanding a certain matter.
Thank you so much for a brief description. I have a question regarding BFS. Why arent be adding Node A in the Queue at the start of the Traversal?? Kindly reply soon.
Both of these algorithms if done using iteration must first push all adjacent elements onto the stack, DFS is the exact same as BFS so you are working with current.
Good presentation to explain the concepts. But you have not explained "when" and "Why" to use these two techniques! In terms of Big O analysis (time and space) which of these technique is better? And in what scenarios? Thanks for your time and effort to share your knowledge with us. The world needs more people like you :-).
Hmm.. how do we establish which way to traverse though? What if those were nodes with data in it and the only identifying feature would be a hashkey. Which way would you start traversing then?
Bruh I legit thought you were some non Indian professor until I finished the video and scrolled down to give a like and then I saw your name and I'm like what whaaa!! xD Great Video TYSM!
Hello, Mr. Tripathi, what graphics software are you using for your lectures? I would love to use it as well in mine. I assume you can project it on a screen in front of a lecture classroom. Thanks in advance.
Best video i've seen so far about BFS and DFS, great work!
Thank you :)
wrong
same
true
This is the best explanation of DFS and BFS I have found on UA-cam.
now a days youtube lectures are far better than poor eng prof
or newly grad lecturer
so true
U damn right
can't read what they are writing.
Amal 😅
This was the best explanation of these methods I've seen thus far. Thanks for the finals prep, dude.
I loved everything about this video. He spoke slowly and clearly, and he ran through the entire graph rather than just the first couple nodes.
Some of the example can be so obvious, that I don't have to read other articles and watch other videos. This is definitely of such videos. Great job!
Short and sweet. Nice. Best DFS and BFS explanations I've seen so far.
Best explanation I've ever seen on BST and DST. Job well done!! Keep doing great things!!!!!!
you know... when ever i search for DFS n bfs example... non of the video example helped me out ... but ur way of explanation is awesome... n whenever i got stuck i just looked for ur video... thank u so much...
Just to clarify, the uploader was not the original creator of this video, but rather a re-uploader for a past video that has been removed.
Isn't that clearly mentioned in the description already?
@@abhinavtripathi It's mentioned but it isn't clear. "Modified from" does not necessary mean "Credits given to" - it can be easily misunderstood as you've "created" the video by modifying that original video, instead of reuploading it. That's why so many people in the comments still assume "you" are the original creator. If I were you, I would at least change the "modified from" to something clearer to avoid confusion.
Nailed it, sir. I went through 5 other different videos about the topic and yours is the shortest and to the point.
Have been banging my head for something that is so simple, this video actually covers what we need to know for an exam! Thanks, Abhi!!
+Vedha Peri glad that it helped..
Explained clearly with no ambiguity. Thank you.
Please share with others so that more people can benefit from it.
Many thanks to guys like you. You are the reason that we succeed on university
Thanks for the kind words. Please share with your friends as well
I've watched a lot of videos about this topic, but this video is the best one by a mile. Thanks a lot for the video.
This was literally the only video on BFS / DFS that I understood.
many thanks- you've taken something that I've see obfuscated in several videos and made it clear and precise
Thank you so much for this! You are 100 times better than my PhD teacher with 50 years+ of eng experience.
A BIG THANKYOU! YOu explained it so clearly!! I regret not finding this video before my actual painful lecture where the prof couldn't explain such a simple thing properly.
Best of what I have seen about BFS and DFS...............So much helpful........Keep on making such useful videos
Thanks Sudhakar :) Please share with others who might find it useful!
So far best explanatory video !!! trust me i have like wasted my 2 hours looking at videos hoping they will give me good info. thank you very much for your explanation.
happy that it helped :)
thanks so much!....i was just not able to understand these 2 traversals after trying so many times.....managed to understand from this in one go!...BRILLIANT n SIMPLE!
Great video! Couldn't understand the concept until this video, keep up the good work!
Have an exam coming up at 12:30
Thank you very much for this clear definition
This clip is so clear with every steps. Thanks for this.
Thanks for the appreciation, please share with your friends too
i loved your explanation better than my teacher's thanks a lot..n please do more such teachings
SImple and precise.Thanks for the video
Please do share with your friends who might need it :)
Thank you very much, it nelped a lot! You are an inspiriation for making tutorials for other people, who have difficulties with understanding a certain matter.
Extremely concise, exactly what I needed to know. Thanks!
you are the man! its my exam tomorrow and youre like a superhero,, best ever
Thank you for being more helpful than our doctor
Nice explanation. Easy to understand. Nice work.
Yayy :D
So far, the best!
I wish i came across this in the first place instead of getting confused with the other videos!
cheers :)
that's the best explanation of BFS and DFS I have found! Thank you so much, everything is so clear
Best explanation ever!! Simple, clear and to the point.
Thank you!
Thanks for sharing the knowledge. The concept was explained clearly and it helps me to prepare for my course.
Thanks for your comment Ankur, kindly share with your friends as well
It helped a lot ! me and my friend were kind of confused but now this is totally clear
Thanks for the great explanation, I came here to try to understand the algorithm but realised I have already implemented it before on my own.
Simple. Precise. Clear. Thank you for this video
The day after tomorrow is my algorithm exam, hardly attended to the classes and then I found this video. :)
nice video! makes way more sense than the way my professor taught us xD. THANKS!
I think even my 4 yr old niece also understood the graph data structure now! great walk through! thank you!!
next week we have taken DS Exam.
your video extremely help us .
thanks sir.
Please share with your friends too!
perfect! So much better than reading articles or PPT
Now I will never forget BFS and DFS
It's the best one I have seen so far, thank you soooooo much
Thanks so much for helping me understand the BFS and DFS, which would be tested in our final exam. The example is good and easy to understand !!!
+Zack Micheal hey, all the best for your exam!
Thanks man!
Others couldn't explain this good!
great that it helped... please do share!
simple and great, it cleared all my doubt.thanks.
Glad that this video helped you :) Please share with others too!
abhinav tripathi offcourse i do.i already recommended my friend.
Well explained, simple and precise. Greetings from Kenya, Maseno University. :-)
Best video on these two I swear
Please share with your friends as well so that more people can benefit from it.. Thanks!
Seriously better than my lecturer! Thumbs Up!
Simply best, tried several videos, this is the one made it stick to my subconcious.
you should honestly make more coding interviews. nice and simple explanation!
tomorrow is my exam....this is the bfs video i have ever seen.... thankss sir :)
Sourav Ghosh all the best for your exam!!!
thnxx sir :)
Heyy!! It made me understand completely :)
How can one be so good at explaining !
glad that it helped :D
good, very very simple and easier than other videos. thanks.
Thank you very much. It has been a great help for me.
Greetings from spain!!!
¡Muchas gracias!.
Thank you, you are a very good teacher. I learned it easily!
Best explanation sir ❤️😍.
Thank you so much for making me understand 🙈❤️
thank you so much for this wonderful video!
Please share with your friends as well
I have only one word to say. Awesome
very clear, better than the other DFS BFS tutorial. Nice graph explanation.
Great explanation with quality presentation.
awesome video. simple straight forward and clear.
really Very Simple and Easy Explanation of BFS and DFS. Thanks a lot
Thank you so much for a brief description. I have a question regarding BFS. Why arent be adding Node A in the Queue at the start of the Traversal??
Kindly reply soon.
Clear cut explanation no bullshit. Thank you very much! Can you explain finding the shortest path using breadth first search?
Thanks! a hug from Brazil!
For others, BFS starts at 4:42
the video was so clear and explanatory.... thanks :) it would be nice if u post some more vidoes for minimum spanning tre algorithms too..
thank you this will save me on my final
It did help me a lot. Very useful and simple.
Both of these algorithms if done using iteration must first push all adjacent elements onto the stack, DFS is the exact same as BFS so you are working with current.
The only difference is that one uses a stack and the other uses a queue
Good presentation to explain the concepts. But you have not explained "when" and "Why" to use these two techniques!
In terms of Big O analysis (time and space) which of these technique is better? And in what scenarios?
Thanks for your time and effort to share your knowledge with us. The world needs more people like you :-).
www.geeksforgeeks.org/applications-of-depth-first-search/
very clear and easy to understand, thanks for it!
Thanks, you made it so understandable! That is a good lecture right there.
thank you soo much😍helped alot
Please share with others who might need it as well :)
precise and clear, keep up the good work
Simple and Nice explanation. Thanks!
Best video about BFS and DFS, thanks!!!
Hmm.. how do we establish which way to traverse though? What if those were nodes with data in it and the only identifying feature would be a hashkey. Which way would you start traversing then?
very easy to follow.love your work
Super Video. Keep posting bro.. It helps so much.
Thanks for sharing it.
Great tutorial. Can you add a bit on time and space complexity of these algorithms as well. would be great to see the comparison from that perspective
Thanks for helping with my AI hw
very well explained!!! it did help me a lot for a test!
Nice Explanation About BFS and DFS
Glad that it helped... Please share with your colleagues as well so that max people benefit from it! Thanks :)
Wow, its really great. I loved it.
Thanks. Crystal clear all this graph issue
Basically a life saver!
glad it helped
sex?
Great man! My professor explained with some freaking psedo algorithm, didn't understand, one look at this video and that's it.
Happy to help :)
Bruh I legit thought you were some non Indian professor until I finished the video and scrolled down to give a like and then I saw your name and I'm like what whaaa!! xD Great Video TYSM!
bhai india me hi rehta hai na.... kyunki accent se to america ka lagg rha hai
Hello, Mr. Tripathi, what graphics software are you using for your lectures? I would love to use it as well in mine. I assume you can project it on a screen in front of a lecture classroom. Thanks in advance.
Thank you very much
This is so easy to understand 😄
Great explanation! Thx man. Now to pass data structures...
Can you tell me how you record your videos?It will be great help.I really like your way of presenting.
Very good explanation! Thank you!
Very successful explanation, thank you :)
Thanks Ferda... Please do share with others who need it :)
Thank you, it helped me a lot!