알고리즘

[파이썬 알고리즘]deque로 하는 BFS

from collections import deque graph = [[], [2, 3], [1, 8], [1, 4, 5], [3, 5], [3, 4], [7, 8], [6, 8], [2, 6, 7]] def bfs(graph, node, visited): queue = deque([node]) visited[node] = True while queue: v = queue.popleft() print(v, end = ' ') for i in graph[v]: if not visited[i]: queue.append(i) visited[i] = True visited = [False]*9 bfs(graph, 1, visited)