BFS 예제

• Breadth-First Search(너비 우선 탐색) 코드로 짜기
•  

from collections import deque
def bfs(graph, start, visited):
  queue = deque([start]) #queue자료 구조를 사용함
  visited[start] = True
  while queue:
    v=queue.popleft()
    print(v,end=' ')
    for i in graph[v]:
      if not visited[i]:
        queue.append(i)
        visited[i]=True
graph = [[],[2,3,8],[1,7],[1,4,5],[3,5],[3,4],[7],[2,6,8],[1,7]]
visited = [False]*9
bfs(graph, 1,visited)