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

📖 문제

📃 코드

from collections import deque
import sys
input = sys.stdin.readline

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

matrix = [[0]*(N+1) for i in range(N+1)]
visited = [False] * (N+1)
visited1 = [False] * (N+1)

for i in range(M):
    a, b = map(int, input().split())
    matrix[a][b] = matrix[b][a] = 1


def dfs(V):
    visited[V] = True
    print(V, end=" ")
    # 수행동작
    for i in range(N+1):
        if visited[i] == False and matrix[V][i] == 1:
            dfs(i)

def bfs(V):
    dQ = deque()
    dQ.append(V)
    visited1[V] = True
    while dQ:
        x =  dQ.popleft()
        print(x, end=" ")
        for i in range(1, N+1):
            if visited1[i] == False and matrix[x][i] == 1:
                dQ.append(i)
                visited1[i] = True
dfs(V)
print()
bfs(V)

 

🔗 링크

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

1260번: DFS와 BFS