[SWEA][Python] 5105 미로의 거리 평범한 2차원 그래프 탐색. from collections import deque def BFS(x,y): visited = [[-1]*N for _ in range(N)] visited[x][y] = 0 queue = deque() queue.append([x,y]) while queue: x, y = queue.popleft() for i in range(4): nx = x + dx[i] ny = y + dy[i] if 0 practivceAlgorithm/swexpertacademy 2021.08.20