How can I implement Depth-First Search in my project?

How can I implement Depth-First Search in my project?

To implement Depth-First Search (DFS), you can use either recursion or a stack. Which one would you prefer?

I think recursion would be easier. Can you show me an example?

Sure! Here's a simple recursive DFS implementation in Python:

def dfs(node):
    if node is None:
        return
    print(node.value)  # Process the node
    for child in node.children:
        dfs(child)

What if I want to keep track of visited nodes?

You can maintain a set of visited nodes. Here's an updated version:

visited = set()

def dfs(node):
    if node is None or node in visited:
        return
    visited.add(node)
    print(node.value)
    for child in node.children:
        dfs(child)