[7.4] Depth First Search(DFS) in Python | Data Structures in Python

Depth First Search algorithm is used to traverse graph or binary tree in such a way that it initially ignores the adjacent nodes and keep exploring the current node recursively.
In this tutorial we have used plain recursion to implement DFS in python.
🔗Important Links:
Data Structures in Python: www.thinkxacademy.com/Data%20...
Data Structures in Python(Playlist): • Data Structures in Python
🌐Join our community:
Android App(Notes+Videos): play.google.com/store/apps/de... Facebook: / thinkxacademy Twitter: / thinkxacademy Instagram: / thinkxacademy
#dsa #python #dfs #datastructuresandalgorithms #dsalgo #graphinpython

[@Ruin3.14]

I've struggled with dfs and bfs and your tutorials are what I needed. Thank you

[@smith_24]

thank you so much.... for the detailed explanation..... needed it the most! Keep posting such detailed explainations!

[@mister_bake2743]

Thanks, mate. Great explanation as usual!

[@devarshisingh9349]

could have used stack. but good explanation any way.

[@arthgupta614]

bro you really helped me alot keep on posting such quality and concised tutorials

[@ThinkXAcademy]

Thanks arth😄 Do share with other students👍🏻

[@subratsingh6204]

precise info and good explanation ! Thanks for makign this!

[@ThinkXAcademy]

Share with other students also💯

[@Akash-dd6ev]

thank you so much, good explanation

[@shaneebkottakkal3491]

Great tutorial bro, keep Going

[@pabloescoblart2605]

great tutorial!

[@013mohammedsaif3]

Great explanation sir !!

[@diwakarsharma2821]

Really clean and helpful

[@ThinkXAcademy]

Thanks😀This really motivates me to create these videos😄

[@dishandshah660]

Thank you!

[@BHANUPRAKASH-nc8hz]

thank u bro for a clear explanation

[@ThinkXAcademy]

Please share our videos to support us

[@krrishshylock6984]

Thanks Bhai

[@shaneebkottakkal3491]

quality content

[@arielcototapia1746]

i will be very helpfully if u put any subtitles

[@muhammadiftikhar3152]

Dear Sir,kya ek full stack developer ko cloud ana chaheye. Or agr haan tu aws ki kon se certification krne chaheye.

[@ThinkXAcademy]

if you will leran cloud it will help you a lot in web development since a lot of companies use cloud for backend, I will suggest you to take AWS cloud practitioner it will be sufficient ✅

[@varunshrivastava2706]

In dfs does it matter from which side we start traversal left or right?

[@ThinkXAcademy]

No it does not but using different will give different results

[@fatimasalah7006]

Thank you so much

[@ThinkXAcademy]

Welcome😄Share with other students also💯

[@fatimasalah7006]

@@ThinkXAcademy I already shared it

[@shyamsingharoy4853]

💥

[@suneosama939]

E[] for neighbour in graph[E] why it work? Abecd, e doesn't have c, can anybody explain? 😅

[@pcexpertsahil]

I need your help urgently ! Can you please help me with my college assignment? I have to implement breadth-first algorithm into into matrix of n by n size and value of this n is taken from the user as input. This matrix has all the values of 1's and 0's . The zeros in are randomly placed and the quantity of 0's is 10% of the total matrix size nXn.Rest All values are filled with ones. The zeroes are considered to be obstacles and job is to reach from any bottom most corner point to top most corner point preferably diagonally opposite points. I also have to do this same problem by A star search algorithm and compare the time difference between the two.

[@pcexpertsahil]

any help will be appreciated