Learn Depth First Search in 7 minutes ⬇️

Bro what happens when I becomes 3 . The for completes the search and if condition doesn't execute since there is no connection from d i.e 3. The recursion should stop. But it executed for i=4 how

👌👌👌

Thanks!

yosh

guys, I have been learning java for 2 months, but I can't understand why would you need an array of boolean for dfs in this case, can someone explain pls.

I didn't get it, what exactly is the use of this code? I mean, you said that the print statement for the visited nodes is not necessary but besides that, I cant' understand what does the code do?

Dude you're not just bro you're a pro-bro...I understood dfs so easily 😃

Damn, bro. I really needed this video 3 weeks ago! Lol great video!

Love your content Bro :D

Nice Video :)

Java full lacture, python full lacture, and html css full lacture just by you man. Thanks

Hey bro awesome content ❤❤❤👌👌👌👌👌👌
Plz make data structure in C# also
Happy diwali 😊😊😊🙏

Thank you Bro🙂

What is the chance of Bro Code uploading a video about DFS which is the EXACT topic that will be on my tomorrow's exam, dude... stop spying me... and thank u

heap sort bro , i lov u

:((

Sir, if possible, kindly make a video on the implementation of priority queues & it's theory..😇🙏

Happy Diwali Sir ❤️🎉🎉...Keep making videos!

Hello Bro!! can u plss make these algorithms in C++ or Python??
Really love your content♥♥

Happy Diwali Everyone 🙏🙏

great video, I've watched it all already

Happy Diwali bro 🔥

Gracias ✌️

First?

Love you vids bro