How can I implement BFS and DFS in Python?

How can I implement BFS and DFS in Python?

You can implement BFS (Breadth-First Search) and DFS (Depth-First Search) using Python's data structures like lists and queues. Would you like a code example?

Yes, please provide a code example for both algorithms.

Sure! Here's a simple implementation:

from collections import deque

# BFS implementation

def bfs(graph, start):
    visited = set()
    queue = deque([start])
    while queue:
        vertex = queue.popleft()
        if vertex not in visited:
            visited.add(vertex)
            queue.extend(graph[vertex] - visited)
    return visited

# DFS implementation

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

This code assumes graph is a dictionary where keys are nodes and values are sets of neighboring nodes.

What kind of graphs can I use with these implementations?

You can use both implementations with any graph represented as an adjacency list. This can include directed, undirected, weighted, or unweighted graphs.