[BOJ] 1260번:DFS와 BFS

■ 해답

n, m, v = map(int, input().split()) 
graph = [[] for _ in range(n + 1)]
for _ in range(m):
     a, b = map(int, input().split())
     graph[a].append(b)
     graph[b].append(a)
     graph[a].sort()
     graph[b].sort()
  
 visited_dfs = [False] * (n + 1)
 visited_bfs = [False] * (n + 1)
 
 def dfs(graph, v, visited_dfs):
     visited_dfs[v] = True
     print(v, end = ' ')
     for i in graph[v]:
         if not visited_dfs[i]:
             dfs(graph, i, visited_dfs)
 
 def bfs(graph, start, visited_bfs):
     queue = deque([start])
     visited_bfs[start] = True
     while queue:
         v = queue.popleft()
         print(v, end = ' ')
         for i in graph[v]:
             if not visited_bfs[i]:
                 queue.append(i)
                 visited_bfs[i] = True
 
 dfs(graph, v, visited_dfs)
 print()
 bfs(graph, v, visited_bfs)

출처 : https://www.acmicpc.net/problem/1260

1260번: DFS와 BFS