How can I implement graph traversal algorithms in Python?

How can I implement graph traversal algorithms in Python?

You can implement graph traversal algorithms like Depth-First Search (DFS) and Breadth-First Search (BFS) using Python. Would you like a code example for one of these?

Yes, please show me an example of Depth-First Search.

Sure! Here's a simple implementation of DFS using recursion:

def dfs(graph, node, visited=None):
    if visited is None:
        visited = set()
    visited.add(node)
    for neighbor in graph[node]:
        if neighbor not in visited:
            dfs(graph, neighbor, visited)
    return visited

You can call this function with your graph and starting node.

What does the graph structure look like for this DFS implementation?

The graph can be represented as a dictionary where keys are nodes and values are lists of neighboring nodes. For example:

graph = {
    'A': ['B', 'C'],
    'B': ['A', 'D', 'E'],
    'C': ['A', 'F'],
    'D': ['B'],
    'E': ['B', 'F'],
    'F': ['C', 'E']
}