How can I implement graph traversal in Python?

How can I implement graph traversal in Python?

You can implement graph traversal in Python using algorithms like Depth-First Search (DFS) or Breadth-First Search (BFS). Which one would you like to know more about?

Let's start with Depth-First Search.

Great choice! DFS can be implemented using recursion or a stack. Do you want a code example?

Yes, please provide a code example for DFS.

Here's a simple implementation of DFS using recursion:

class Graph:
    def __init__(self):
        self.graph = {}

    def add_edge(self, u, v):
        if u not in self.graph:
            self.graph[u] = []
        self.graph[u].append(v)

    def dfs(self, start, visited=None):
        if visited is None:
            visited = set()
        visited.add(start)
        print(start)
        for neighbor in self.graph.get(start, []):
            if neighbor not in visited:
                self.dfs(neighbor, visited)

# Example usage:
g = Graph()
g.add_edge(1, 2)
g.add_edge(1, 3)
g.add_edge(2, 4)
g.dfs(1)

This will traverse the graph starting from node 1.