Проект: граф и BFS

BFS

from collections import deque
def bfs(g, start):
    seen = {start}
    q = deque([start])
    while q:
        v = q.popleft()
        for u in g[v]:
            if u not in seen:
                seen.add(u); q.append(u)
    return seen