[백준] 1260번_DFS와BFS

문제 링크 : https://www.acmicpc.net/problem/1260

1260번: DFS와 BFS

from collections import deque
#인접리스트 활용
N,M,V = map(int,input().split())
adjacent = [[] for _ in range(N+1)]
for _ in range(M):
    s,e = map(int,input().split())
    adjacent[s].append(e)
    adjacent[e].append(s)

for i in range(len(adjacent)):
    adjacent[i] = sorted(adjacent[i])
# dfs 
check = [False for _ in range(N+1)]
check[0] = True
def dfs(x):
    check[x] = True
    print(x,end=" ")
    for i in range(len(adjacent[x])):
        y = adjacent[x][i]
        if not check[y]:
            dfs(y)
dfs(V)
print()
# bfs         
def bfs(x):
    queue = deque()
    check = [False for _ in range(N+1)]
    check[0] = True; check[V] = True
    queue.append(V)
    while queue:
        x = queue.popleft()
        print(x,end=" ")
        for i in range(len(adjacent[x])):
            y = adjacent[x][i]
            if not check[y]:
                check[y] = True
                queue.append(y)
bfs(V)