diff --git "a/graph_traversal/\353\260\261\354\244\200_11403_\352\262\275\353\241\234\354\260\276\352\270\260.py" "b/graph_traversal/\353\260\261\354\244\200_11403_\352\262\275\353\241\234\354\260\276\352\270\260.py"
new file mode 100644
index 0000000..3dfb904
--- /dev/null
+++ "b/graph_traversal/\353\260\261\354\244\200_11403_\352\262\275\353\241\234\354\260\276\352\270\260.py"
@@ -0,0 +1,34 @@
+#간선추가할 때, 양쪽에서 이어지는 것인 줄 알았는데 
+#하나만 추가하면 됐었다.
+from collections import deque
+n = int(input())
+num=[[] for _ in range(n)]
+
+for i in range(n):
+    x=list(map(int,input().split()))
+    for j in range(n):
+        if x[j]==1:
+            num[i].append(j)
+        
+def bfs(a):
+    visit=[0]*n
+    q=deque()
+    q.append(a)
+    while q:
+        x=q.popleft()
+        for nx in num[x]:
+            if visit[nx]==0:
+                visit[nx]=1
+                q.append(nx)
+    return visit
+
+for i in range(n):
+    result=bfs(i)
+    for j in range(n):
+        print(result[j],end=' ')
+    print()
+    
+#메모리 : 34140 kb
+#시간 : 80 ms
+#코드길이 : 597 b
+#풀이시간 : 30분(대충)
\ No newline at end of file
diff --git "a/graph_traversal/\353\260\261\354\244\200_12851_\354\210\250\353\260\224\352\274\255\354\247\2102.py" "b/graph_traversal/\353\260\261\354\244\200_12851_\354\210\250\353\260\224\352\274\255\354\247\2102.py"
new file mode 100644
index 0000000..e4c6fce
--- /dev/null
+++ "b/graph_traversal/\353\260\261\354\244\200_12851_\354\210\250\353\260\224\352\274\255\354\247\2102.py"
@@ -0,0 +1,34 @@
+# 다시풀기
+from collections import deque
+n,k=map(int,input().split())
+gragh=[0]*100001
+visit=[0]*100001
+
+cnt=0
+res=0
+q=deque()
+
+def bfs(a):
+    global res,cnt
+    q.append(a)
+    while q:
+        x=q.popleft()
+        temp=gragh[x]
+        if x==k:
+            cnt+=1
+            res=temp
+            continue
+        for nx in [x-1,x+1,2*x]:            
+            if 0<=nx<100001 and (gragh[nx]==0 or gragh[nx]==gragh[x]+1):
+                gragh[nx]=gragh[x]+1
+                q.append(nx)
+    return res,cnt
+                
+x,y=bfs(n)
+print(x)
+print(y)
+
+#메모리 : 38468 kb
+#시간 : 380 ms
+#코드길이 : 547 b
+#풀이시간 : 53분
\ No newline at end of file
diff --git "a/graph_traversal/\353\260\261\354\244\200_13549_\354\210\250\353\260\224\352\274\255\354\247\2103.py" "b/graph_traversal/\353\260\261\354\244\200_13549_\354\210\250\353\260\224\352\274\255\354\247\2103.py"
new file mode 100644
index 0000000..6455752
--- /dev/null
+++ "b/graph_traversal/\353\260\261\354\244\200_13549_\354\210\250\353\260\224\352\274\255\354\247\2103.py"
@@ -0,0 +1,27 @@
+# gragh초기화 값을 0에서 -1로만 바꾸어주니까 바로 성공했다.. 왜지?
+from collections import deque
+n,k = map(int,input().split())
+gragh=[-1]*100001
+gragh[n]=0
+q=deque()
+q.append(n)
+cnt=0
+
+while q:
+    x=q.popleft()
+    if x==k:
+        print(gragh[x])
+        break
+    for nx in [x-1,x+1,x*2]:
+        if 0<=nx<100001 and gragh[nx]==-1:
+            if nx==x*2:
+                gragh[nx]=gragh[x]
+                q.appendleft(nx)
+            else:
+                gragh[nx]=gragh[x]+1
+                q.append(nx)
+                
+#메모리 : 35364 kb
+#시간 : 132 ms
+#코드길이 : 444 b
+#풀이시간 : 34분
\ No newline at end of file
diff --git "a/graph_traversal/\353\260\261\354\244\200_16928_\353\261\200\352\263\274\354\202\254\353\213\244\353\246\254\352\262\214\354\236\204.py" "b/graph_traversal/\353\260\261\354\244\200_16928_\353\261\200\352\263\274\354\202\254\353\213\244\353\246\254\352\262\214\354\236\204.py"
new file mode 100644
index 0000000..249ab0d
--- /dev/null
+++ "b/graph_traversal/\353\260\261\354\244\200_16928_\353\261\200\352\263\274\354\202\254\353\213\244\353\246\254\352\262\214\354\236\204.py"
@@ -0,0 +1,41 @@
+from collections import deque
+n,m = map(int,input().split())
+sa={}
+snake={}
+for i in range(n):
+    x,y = map(int,input().split())
+    sa[x]=y
+for i in range(m):
+    u,v=map(int,input().split())
+    snake[u]=v
+    
+gragh=[0]*101
+
+visit=[0]*101
+
+def bfs(a):
+    q=deque()
+    q.append(a)
+    while q:
+        x=q.popleft()
+        if x==100:
+            return gragh[100]
+        for i in range(1,7):
+            nx=x+i
+            if 0<nx<=100 and visit[nx]==0:
+                if nx in sa:
+                    nx=sa[nx]
+                elif nx in snake:
+                    nx=snake[nx]
+                if visit[nx]==0:
+                    visit[nx]=1
+                    gragh[nx]=gragh[x]+1
+                    q.append(nx)
+
+x=bfs(1)                
+print(x)
+
+#메모리 : 34176 kb
+#시간 : 64 ms
+#코드길이 : 760 b
+#풀이시간 : 약 1시간
\ No newline at end of file
diff --git "a/graph_traversal/\353\260\261\354\244\200_1743_\354\235\214\354\213\235\353\254\274\355\224\274\355\225\230\352\270\260.py" "b/graph_traversal/\353\260\261\354\244\200_1743_\354\235\214\354\213\235\353\254\274\355\224\274\355\225\230\352\270\260.py"
new file mode 100644
index 0000000..07447f1
--- /dev/null
+++ "b/graph_traversal/\353\260\261\354\244\200_1743_\354\235\214\354\213\235\353\254\274\355\224\274\355\225\230\352\270\260.py"
@@ -0,0 +1,42 @@
+from collections import deque
+n,m,k = map(int,input().split())
+gragh=[[0]*m for _ in range(n)]
+for i in range(k):
+    r,c = map(int,input().split())
+    gragh[r-1][c-1]=1
+    
+result=0
+dx=[0,0,1,-1]
+dy=[-1,1,0,0]
+visit=[[0]*m for _ in range(n)]
+
+def bfs(a,b):
+    global cnt
+    q=deque()
+    q.append((a,b))
+
+    while q:
+        x,y=q.popleft()
+        for i in range(4):
+            nx=x+dx[i]
+            ny=y+dy[i]
+            if 0<=nx<n and 0<=ny<m and gragh[nx][ny]==1 and visit[nx][ny]==0:
+                cnt+=1
+                visit[nx][ny]=1
+                q.append((nx,ny))
+    # return cnt
+
+for i in range(n):
+    for j in range(m):
+        if visit[i][j]==0 and gragh[i][j]==1:
+            cnt=0
+            bfs(i,j)
+            # print(ans)
+            result=max(result,cnt)
+# print(gragh)
+print(result)
+
+#메모리 : 34176 kb
+#시간 : 272 ms
+#코드길이 : 820 b
+#풀이시간 : 33분
\ No newline at end of file
diff --git "a/graph_traversal/\353\260\261\354\244\200_1987_\354\225\214\355\214\214\353\262\263.py" "b/graph_traversal/\353\260\261\354\244\200_1987_\354\225\214\355\214\214\353\262\263.py"
new file mode 100644
index 0000000..04e228e
--- /dev/null
+++ "b/graph_traversal/\353\260\261\354\244\200_1987_\354\225\214\355\214\214\353\262\263.py"
@@ -0,0 +1,35 @@
+# 시간초과,, set으로 풀어야 하는 것 같다..
+from collections import deque
+r,c = map(int,input().split())
+gragh=[]
+# al=[]
+for i in range(r):
+    gragh.append(list(input()))
+
+dx=[0,0,1,-1]
+dy=[-1,1,0,0]
+
+# visit=[[0]*c for _ in range(r)]
+cnt=1
+
+q=deque()
+q.append((0,0,gragh[0][0]))
+# visit[0][0]=1
+# al.append(gragh[0][0])
+while q:
+    x,y,al = q.popleft()
+    for i in range(4):
+        nx=x+dx[i]
+        ny=y+dy[i]
+        if 0<=nx<r and 0<=ny<c and gragh[nx][ny] not in al:
+            # al.append(gragh[nx][ny])
+            # visit[nx][ny]=1
+            q.append((nx,ny,al+gragh[nx][ny]))
+            cnt=max(cnt,len(al)+1)
+# print(al)
+print(cnt)
+
+#메모리 :  kb
+#시간 :  ms
+#코드길이 : 607 b
+#풀이시간 : 약 1시간
\ No newline at end of file
diff --git "a/graph_traversal/\353\260\261\354\244\200_2668_\354\210\253\354\236\220\352\263\240\353\245\264\352\270\260.py" "b/graph_traversal/\353\260\261\354\244\200_2668_\354\210\253\354\236\220\352\263\240\353\245\264\352\270\260.py"
new file mode 100644
index 0000000..ceddb28
--- /dev/null
+++ "b/graph_traversal/\353\260\261\354\244\200_2668_\354\210\253\354\236\220\352\263\240\353\245\264\352\270\260.py"
@@ -0,0 +1,10 @@
+# 1->3,3->1, 5->5 이런식으로 사이클이 생겨야 하는 건 알겠다.
+# 이걸 어떻게 구현해야 하는지는 모르겠다.
+
+n = int(input())
+num={}
+for i in range(1,n+1):
+    num[i]=int(input())
+
+# dfs로 풀기
+# 정점들을 돌면서 연결이 되는지 파악,,
diff --git "a/graph_traversal/\353\260\261\354\244\200_3055_\355\203\210\354\266\234.py" "b/graph_traversal/\353\260\261\354\244\200_3055_\355\203\210\354\266\234.py"
new file mode 100644
index 0000000..1a4fab2
--- /dev/null
+++ "b/graph_traversal/\353\260\261\354\244\200_3055_\355\203\210\354\266\234.py"
@@ -0,0 +1,33 @@
+# 다시 풀기..(이해는 되지만 구현을 못하겠다)
+from collections import deque
+
+r,c = map(int,input().split())
+gragh=[]
+for i in range(r):
+    gragh.append(list(input()))
+    
+dx=[0,0,-1,1]
+dy=[1,-1,0,0]
+
+visit=[[0]*c for _ in range(r)]
+
+q=deque()
+
+def bfs(a,b):
+    q.append((a,b))
+    while q:
+        x,y=q.popleft()
+
+        for i in range(4):
+            nx=x+dx[i]
+            ny=y+dy[i]
+            if 0<=nx<r and 0<=ny<c:
+                if (gragh[nx][ny]=="." or gragh[nx][ny]=="D") and gragh[x][y]=="S":
+                    gragh[nx][ny]="S"
+                    visit[nx][ny]=visit[x][y]+1
+                    q.append((nx,ny))
+                elif (gragh[nx][ny]=="." or gragh[nx][ny]=="S") and gragh[x][y]=="*":
+                    gragh[nx][ny]="*"
+                    q.append((nx,ny))
+    return "KAKTUS"
+