广度优先搜索

广度优先搜索BFS: def bfs(seed): q = queue() q.put(seed) while not q.empty(): now...