jason9288
diff --git a/‎Source/ch01/15649.cpp renamed to ‎Code/#1/HHS/Source/ch01/15649.cpp b/‎Source/ch01/15649.cpp renamed to ‎Code/#1/HHS/Source/ch01/15649.cpp
diff --git a/‎Source/ch03/10814.cpp renamed to ‎Code/#1/HHS/Source/ch03/10814.cpp b/‎Source/ch03/10814.cpp renamed to ‎Code/#1/HHS/Source/ch03/10814.cpp
diff --git a/‎Source/ch03/2751.cpp renamed to ‎Code/#1/HHS/Source/ch03/2751.cpp b/‎Source/ch03/2751.cpp renamed to ‎Code/#1/HHS/Source/ch03/2751.cpp
diff --git a/‎Source/ch04/1764.cpp renamed to ‎Code/#1/HHS/Source/ch04/1764.cpp b/‎Source/ch04/1764.cpp renamed to ‎Code/#1/HHS/Source/ch04/1764.cpp
diff --git a/‎Source/ch04/1920.cpp renamed to ‎Code/#1/HHS/Source/ch04/1920.cpp b/‎Source/ch04/1920.cpp renamed to ‎Code/#1/HHS/Source/ch04/1920.cpp
diff --git a/‎NTW/수식 최대화.cpp renamed to ‎Code/#1/NTW/수식 최대화.cpp b/‎NTW/수식 최대화.cpp renamed to ‎Code/#1/NTW/수식 최대화.cpp
diff --git a/‎Concept/07_Graph_Traversal/Sample_Code/Python/BOJ_2178.py
Lines changed: 32 additions & 0 deletions b/‎Concept/07_Graph_Traversal/Sample_Code/Python/BOJ_2178.py
Lines changed: 32 additions & 0 deletions
@@ -0,0 +1,32 @@
+"""
+문제: 미로탐색 (http://boj.kr/2178)
+Tier: Silver 1 (2021.01.18 기준)
+Comment: 최단거리 -> BFS!
+"""
+
+from collections import deque
+import sys
+
+N, M = map(int, sys.stdin.readline().rstrip().split())
+graph = [list(input()) for i in range(N)]
+visited = [[0 for i in range(M)] for i in range(N)]
+dx = [1, -1, 0, 0]
+dy = [0, 0, 1, -1]
+
+def bfs():
+    dq = deque()
+    dq.append((0, 0))
+    visited[0][0] = 1
+
+    while len(dq):
+        x, y = dq.popleft()
+        for i in range(4):
+            X = x + dx[i]; Y = y + dy[i];
+            if X < 0 or X == N or Y < 0 or Y == M:
+                continue
+            if graph[X][Y] == '1' and visited[X][Y] == 0:
+                visited[X][Y] = visited[x][y] + 1
+                dq.append((X, Y))
+    
+bfs()
+print(visited[N - 1][M - 1])