Depth First Search (DFS) - 5 minutes algorithm - python [Imagineer]

[@tbaqar]

Wow this was by far the easiest tutorial on DFS that included code. Thank you!

[@kamaboko1]

OMG, by far the best explanation I've seen. You can teach my college prof how to explain this.

[@TheNighIsCallingMe]

great work. we need tutorial as easy, short and effective like this

[@elenatalley7899]

The best explanation! Thank you!

[@LuisAlberto-gi6ml]

It was the fastest explanation I see. Thank you!!!

[@akboss4341]

this guys needs best teacher award

[@TheZeetskeet]

Best explanation! You're amazing, please carry on!

[@treksis]

phenomenal explanation

[@vuongtiennguyen3268]

quiet ez understandable code and explanation. Thank you! :3

[@Maca-c2s]

DFS 개념 이해하는데 도움 많이 됐습니다!

[@electric336]

Excellent video.

[@abchrisyou]

고맙습니다.

[@learningeveryday9603]

Thanks a lot. Specially for the code.

[@cherryBlossomE7]

wow this was so helpful! Thank you so much!

[@Doctor.Fortnite]

This prints output from right to left but what if I want to print left to right?

[@TheEasyoung]

Umer Naeem hi, there are many ways to it, you can reverse output once it is ready :) that is the easiest way from existing code.

[@bostevens236]

Thanks a lot. Add a link from this video to your Graph Concepts video!!

[@treelight1707]

Nice presentation, really easy to follow. I have a question. It seems that we don't need the visited_vertex list if this is a tree, not a graph, right?

[@TheEasyoung]

thanks, I believe you still need visited_vertex since even if it is a tree, you should check if the neighbor of current node is already visited or not.

[@rajsahni3988]

@@TheEasyoungcan we solve it by recursion too

[@siddharthasharma9316]

Thank you

[@pratikdhargalkar4876]

damn brilliant oppa

[@lMatheusx]

Easy to understand the theory, but complex to code ;-;

[@boudjajmaryame6507]

mercii beaucoup

[@TheEasyoung]

vous êtes les bienvenus

[@muddassirghoorun4322]

Nice code