[BOJ] DFS/BFS - DFS와 BFS

www.acmicpc.net/problem/1260

1260번: DFS와 BFS

 

import sys
from collections import deque
import copy

n, m, start = map(int, sys.stdin.readline().rstrip().split())
graph = [[] for _ in range(n + 1)]
visited = [False] * (n + 1)

for _ in range(m):
    a, b = map(int, sys.stdin.readline().rstrip().split())
    graph[a].append(b)
    graph[b].append(a)


# 정점 번호가 작은 것부터 먼저 방문
for i in range(1, n + 1):
    graph[i] = sorted(graph[i])


def dfs(vertex, visited):
    visited[vertex] = True
    print(vertex, end=" ")

    for v in graph[vertex]:
        if not visited[v]:
            dfs(v, visited)


def bfs(vertex, visited):
    queue = deque()
    queue.append(vertex)
    visited[vertex] = True

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

        for v in graph[now]:
            if not visited[v]:
                queue.append(v)
                visited[v] = True


dfs(start, copy.deepcopy(visited))
print()
bfs(start, copy.deepcopy(visited))