Translation: Depth-first search is a method for exploring a graph or tree by following one path as possible before backtracking and exploring another path. It goes deep into one branch first, then returns to explore other branches. For example, in web crawling, it may follow links from one webpage to deeper pages until no further links are available and then backtrack. It is useful for tasks such as web crawling.