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

문제 출처 : www.acmicpc.net/problem/1260

1260번: DFS와 BFS

내 풀이

bfs와 dfs를 간단히 구현해보는 문제였다.

import sys
from collections import deque

input = sys.stdin.readline
   
def dfs(v):   
    check[v] = 1
    print(v, end = ' ')
    for i in range(1, n + 1):
        if check[i] == 0 and arr[v][i] == 1:
            dfs(i)

def bfs(v):
    a = [v]
    check[v] = 0
    while a:
        k = a.pop(0)     
        print(k, end = ' ')
        for i in range(1, n + 1):
            if check[i] == 1 and arr[k][i] == 1:
                a.append(i)
                check[i] = 0
              
n, m, v = map(int, input().split())

arr = [[0]*(n + 1) for _ in range(n + 1)]

for i in range(m):
    x, y = map(int, input().split())
    arr[x][y] = 1
    arr[y][x] = 1
check = [0] * (n + 1)

dfs(v)
print()
bfs(v)