摘要： 1 class Solution: 2 def bfs(self,connections,visited,l,neighbours): 3 while len(l) > 0: 4 temp = [] 5 while len(l) > 0: 6 p = l.pop() 7 if visited[p] 阅读全文