BFS(queue)_python

bfs_queue.py

def bfs(start_v):
    discovered = [start_v]
    queue = deque()
    queue.append(start_v)
    while queue:
        v = queue.popleft()
        for w in graph[v]:
            if w not in discovered:
                discovered.append(w)
                queue.append(w)
    return discovered

# adjacency list
graph = {
    1: [2, 3, 4],
    2: [5],
    3: [5],
    4: [],
    5: [6, 7],
    6: [],
    7: [3],
}