DFS 작은 숫자 먼저 탐색

# 정점 개수 N, 간선 개수 M, 탐색 시작 번호 V
N, M, V = map(int, input().split())

edgeList = []
graph = [[] for vertex in range(N+1)]

for i in range(M):
    e0, e1 = map(int, input().split())
    edgeList.append((e0, e1))

for edge in edgeList:
    graph[edge[0]].append(edge[1])
    graph[edge[1]].append(edge[0])

for i in range(len(graph)):
    graph[i].sort(reverse=True)

#DFS
def DFS(graph, V) :
    visited = []
    stack = [V]

    while stack :
        print("-------------------")
        current = stack.pop()

        if current in visited:  # 이미 방문한 노드는 무시
            continue

        print("현재 방문", current)

        for n in graph[current]:
            print("이웃",n)
            if not n in visited:
                print("방문해야할이웃",n)
                stack.append(n)
                print("스택", stack)
        visited.append(current) # 방문 처리
        print("방문처리", visited)
    return visited

print(DFS(graph, V))

#BFS