[23.01.04/Python] 미로 탐색 (BFS)

Author: par3k

Python_BOJ_2023/2178.py

@@ -0,0 +1,24 @@
+# 미로 탐색
+from collections import deque
+dx, dy = [-1, 1, 0, 0], [0, 0, -1, 1]
+
+n, m = map(int, input().split())
+graph = [list(map(int, input())) for _ in range(n)]
+visited = [[0] * m for _ in range(n)]
+
+def bfs():
+    queue = deque()
+    queue.append((0, 0))
+    visited[0][0] = 1
+
+    while queue:
+        x, y = queue.popleft()
+        for i in range(4):
+            nx, ny = x + dx[i], y + dy[i]
+            if 0 <= nx < n and 0 <= ny < m:
+                if not visited[nx][ny] and graph[nx][ny] == 1:
+                    visited[nx][ny] = visited[x][y] + 1
+                    queue.append((nx, ny))
+
+bfs()
+print(visited[n - 1][m - 1])