What is iterative DFS and how does it work?

Can you explain what iterative DFS is?

Iterative DFS is a depth-first search algorithm that uses a stack to explore nodes without recursion.

How does it differ from recursive DFS?

The main difference is that iterative DFS uses an explicit stack, while recursive DFS relies on the call stack.

What are the advantages of using iterative DFS?

Iterative DFS can handle larger graphs without risking stack overflow and allows for more control over the traversal.

Can you provide a simple example of iterative DFS in code?

Sure! Here's a Python example:

def iterative_dfs(graph, start):
    stack = [start]
    visited = set()
    while stack:
        node = stack.pop()
        if node not in visited:
            visited.add(node)
            stack.extend(graph[node])
    return visited