BFS

题目描述

visited = {}
def bfs(root):
    q = deque()
    q.append(root) #利用queue
    visited[q] = True
    # output root
    while q:
        curr = q.popleft()
        for nb in curr.neighbors:
            if nb not in visited:
                # output nb
                visited[nb] = True
                q.append(nb)

解题方法

Solution

Reference