Where is the depth-first search algorithm applied?

Question

Algorithms

Guys, please tell me where the depth-first search algorithm is applied.
It is necessary for D / Z, that is, you need to come up with some kind of task for yourself, and then solve it using the above algorithm.
It should be related to the real subject area, nothing comes to mind except for indexing the pages of the website ...
Do not throw resources for "read", or can you think of something else?

Answer 1

I use depth first search as part of the pathfinding algorithm for the robot.
Specific task: the robot is in a labyrinth, it receives information about the location of the walls using an ultrasonic sensor. It is necessary to go through as many cells of the labyrinth as possible in a period of time.
In my case, the maze is represented by a graph, and the depth-first search is to go through all all the cells of the maze.

Answer 2

Walking around the chessboard.
A wonderful field for a variety of algorithms.

Answer 3

Another important result of the depth-first search is topological sorting by vertex closing time, for the correct execution of dependent actions.
It is used when installing software packages, building source codes, arranging training courses, and that's the connection with the subject activity.
The simplest training example, considered in all textbooks, is in what order to dress.