What are some examples of the DFS algorithm?

Can you explain what the DFS algorithm is?

DFS, or Depth-First Search, is an algorithm for traversing or searching tree or graph data structures.

What are some practical examples of using DFS?

DFS can be used in scenarios like maze solving, topological sorting, and finding connected components in a graph.

How does DFS differ from BFS?

DFS explores as far as possible along a branch before backtracking, while BFS explores all neighbors at the present depth before moving on.

Can you show me a simple code example of DFS?

Sure! Here's a simple Python implementation of DFS:

def dfs(graph, node, visited):
    if node not in visited:
        print(node)
        visited.add(node)
        for neighbor in graph[node]:
            dfs(graph, neighbor, visited)