1function BFS(graph, start):
2 queue.enqueue(start)
3 mark start as visited
4 while queue is not empty:
5 node = queue.dequeue()
6 visit(node)
7 for neighbor in graph[node]:
8 if neighbor not visited:
9 mark neighbor as visited
10 queue.enqueue(neighbor)
No pseudocode line selected.