알고리즘: 백준 1260번 DFS와 BFS (feat.python)

 

1260번: DFS와 BFS

 

 

import sys
from collections import deque
read = sys.stdin.readline
n, m, v = list(map(int, read().split()))
graph ={}
for i in range(n):
    graph[i+1] = deque()

for i in range(m):
    x, y = deque(map(int, read().split()))
    graph[x].append(y)
    graph[y].append(x)

for i in range(n):
    graph[i+1]=sorted(graph[i+1])


def bfs(start):
    stack = deque([start])
    visit = []
    while stack:
        node = stack.popleft()
        if node not in visit:
            visit.append(node)

            for i in graph[node]:
                stack.append(i)
    return visit
def dfs(start):
    stack = deque([start])
    visit = []
    while stack:
        node = stack.popleft()
        if node not in visit:
            visit.append(node)

            for i in graph[node][::-1]:
                stack.appendleft(i)
    return visit

def pretty(list):
    for i in list:
        print(i, end=' ')
pretty(dfs(v))
print()
pretty(bfs(v))