What is the pseudocode for depth-first search?

What is the pseudocode for depth-first search?

Depth-first search (DFS) is an algorithm for traversing or searching tree or graph data structures. Here's a simple pseudocode:

DFS(node):
    if node is not visited:
        mark node as visited
        for each neighbor in node.neighbors:
            DFS(neighbor)

This pseudocode recursively visits each node.

Can you explain how this works with an example?

Sure! Let's say we have a graph with nodes A, B, C, and D. Starting from A, DFS would visit A, then B, then C, and finally D, marking each as visited.

What are the advantages of using depth-first search?

DFS is memory efficient and can be implemented using recursion. It's useful for pathfinding and exploring all possible paths.

Are there any drawbacks to using DFS?

Yes, DFS can get stuck in deep paths and may not find the shortest path in unweighted graphs. It also has a risk of stack overflow with deep recursion.