1def bfs(graph, start):
2 visited = set()
3 queue = [start]
4 visited.add(start)
5 order = []
6 while queue:
7 node = queue.pop(0)
8 order.append(node)
9 for neighbor in graph[node]:
10 if neighbor not in visited:
11 visited.add(neighbor)
12 queue.append(neighbor)
13 return order