백준 1260번(python)

---

N, M, V = map(int, input().split())

matrix = [[0] * (N + 1) for _ in range(N+1)]
for _ in range(M):
    link = list(map(int, input().split()))
    matrix[link[0]][link[1]] = 1
    matrix[link[1]][link[0]] = 1
    
def dfs(current_node, row, foot_prints):
    foot_prints += [current_node]
    for search_node in range(len(row[current_node])):
        if row[current_node][search_node] and search_node not in foot_prints:
            foot_prints = dfs(search_node, row, foot_prints)
            
    return foot_prints

def bfs(start):
    queue = [start]
    foot_prints = [start]
    while queue:
        current_node = queue.pop(0)
        for search_node in range(len(matrix[current_node])):
            if matrix[current_node][search_node] and search_node not in foot_prints:
                foot_prints += [search_node]
                queue += [search_node]
                
    return foot_prints

print(*dfs(V, matrix, []))
print(*bfs(V))

이번 코드는 

https://this-programmer.com/entry/백준1260파이썬-DFS와-BFS

[백준/1260/파이썬3(python3)] DFS와 BFS

블로그를 참고하였습니다. 코드가 깔끔해서 보는사람 입장에선 이 코드를 포스팅하는게 낫다고 생각...