백준 1260번 - DFS와 BFS [python/파이썬]

import sys
 
 
def dfs(start): # 재귀
    if len(visited) == N:
        return
    if start in visited:
        return
    else:
        visited.append(start)
        for node in nodes:
            if node[0] == start:
                dfs(node[1])
 
    return visited
 
 
def bfs(start): # queue
    visited = []
    queue = [start]
    while queue != []:
        start = queue.pop(0)
        visited.append(start)
        for node in nodes:
            if node[0] == start and node[1] not in visited and node[1] not in queue:
                queue.append(node[1])
    return visited
 
 
N, M, V = list(map(int, sys.stdin.readline().strip().split()))
nodes = []
 
for line in range(M):
    a, b = list(map(int, sys.stdin.readline().strip().split()))
    nodes.append([a, b])
    nodes.append([b, a])
nodes = sorted(nodes, key=lambda x: (x[0], x[1]))
 
visited = []
print(*dfs(V))
print(*bfs(V))