How do I implement Breadth-First Search in Python?

How do I implement Breadth-First Search in Python?

To implement BFS in Python, you can use a queue to explore nodes level by level. Would you like a code example?

Yes, please provide a code example.

Here's a simple BFS implementation:

from collections import deque

def bfs(graph, start):
    visited = set()
    queue = deque([start])

    while queue:
        vertex = queue.popleft()
        if vertex not in visited:
            visited.add(vertex)
            queue.extend(neighbor for neighbor in graph[vertex] if neighbor not in visited)
    return visited

This function takes a graph and a starting node as input.

What data structure should I use for the graph?

You can represent a graph using an adjacency list, which is a dictionary where keys are nodes and values are lists of neighboring nodes.