How do I implement breadth-first search in my project?

How do I implement breadth-first search in my project?

To implement breadth-first search (BFS), you can use a queue to explore nodes level by level. Do you have a specific data structure in mind?

I'm using a graph represented as an adjacency list.

Great! You can start by initializing a queue with the starting node, then repeatedly dequeue a node, visit it, and enqueue its unvisited neighbors.

Can you provide a code example for that?

Sure! Here's a simple Python implementation:

from collections import deque

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

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