[Algorithm|Python] 백준 1260번 / 99클럽 코테 스터디 6일차 TIL

import sys
from collections import deque

input = sys.stdin.readline

N, M, V = map(int, input().split())
graph = [[0]*(N+1) for _ in range(N+1)]

for i in range(M):
    a, b = map(int, input().split())
    graph[a][b] = graph[b][a] = 1
    
visited1 = [0] * (N + 1)
visited2 = [0] * (N + 1)

def dfs(V):
    visited1[V] = 1
    print(V, end=' ')
    
    for i in range(1, N + 1):
        if graph[V][i] == 1 and visited1[i] == 0:
            dfs(i)
            
def bfs(V):
    queue = deque([V])
    visited2[V] = 1
    
    while queue:
        V = queue.popleft()
        print(V, end=' ')
        
        for i in range(1, N + 1):
            if(visited2[i] == 0 and graph[V][i] == 1):
                queue.append(i)
                visited2[i] = 1
                
dfs(V)
print()
bfs(V)