How can I implement DFS and BFS in Python?

How can I implement DFS and BFS in Python?

You can implement DFS (Depth-First Search) and BFS (Breadth-First Search) using recursion and queues. Would you like a code example?

Yes, please provide a code example for both algorithms.

Sure! Here's a simple implementation:

# DFS Implementation

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

# BFS Implementation

def bfs(graph, start):
    visited = set()
    queue = [start]
    while queue:
        vertex = queue.pop(0)
        if vertex not in visited:
            visited.add(vertex)
            queue.extend(neighbor for neighbor in graph[vertex] if neighbor not in visited)
    return visited

This code assumes graph is a dictionary where keys are nodes and values are lists of neighbors.

What kind of graphs can I use with these implementations?

You can use both implementations with any graph represented as an adjacency list, including directed, undirected, and weighted graphs. Just ensure the graph is properly structured as a dictionary.