From the course: Python Data Structures and Algorithms

Unlock the full course today

Join today to access over 24,400 courses taught by industry experts.

Understand the depth-first search algorithm

Understand the depth-first search algorithm - Python Tutorial

From the course: Python Data Structures and Algorithms

Start my 1-month free trial Buy for my team

Understand the depth-first search algorithm

“

- [Instructor] Depth-first search is a very important algorithm with many applications in the real world. Let's first look at how depth-first search works in our maze GUI, then we will discuss some of its applications. So if we go to our GUI code in our project and we select maze_gui_explore, and I'm also going to open config so that I can choose whichever maze that I want. I think this is quite a good one to start with, a diagonal maze, so we'll stay with that for now. So then if I run my GUI, Ctrl + Shift + F10 for me, and we're in explore mode of our GUI, as we looked at earlier on. So I'm going to stick with DFS now, so that's the DFS button in red in the middle, and I can choose where I want to place my treasure. So if I place it near the bottom there, and then I press S, and off it goes looking for the treasure. And in this case, it finds it quite quickly. Now, DFS can be described as an aggressive algorithm, in the sense that it will continue down a particular path until either…

Contents