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

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

1260번: DFS와 BFS

 

from collections import deque

n, m, v = map(int, input().split())
graph = [[0 for i in range(n + 1)] for j in range(n + 1)]
visit_d = [0] * (n + 1)
visit_b = [0] * (n + 1)
for i in range(m):
    line = list(map(int, input().split()))
    graph[line[0]][line[1]] = 1
    graph[line[1]][line[0]] = 1


def dfs(graph, v, visit):
    visit[v] = 1
    print(v, end=" ")
    for i in range(len(graph[v])):
        if visit[i] != 1 and graph[v][i] == 1:
            dfs(graph, i, visit)


def bfs(graph, v, visit_b):
    visit_b[v] = 1
    queue = deque([v])

    while queue:
        v = queue.popleft()
        print(v, end=" ")

        for i in range(len(graph[v])):
            if visit_b[i] != 1 and graph[v][i] == 1:
                queue.append(i)
                visit_b[i] = 1


dfs(graph, v, visit_d)
print()
bfs(graph, v, visit_b)