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

백준 1260번 DFS와 BFS

 

 DFS, BFS 탐색 알고리즘은 안보면 계속 까먹게 되네요..ㅎㅎㅎ

 

풀이

n, m, v = map(int, input().split())
import collections

matrix = [[0] * (n+1) for i in range(n+1)]
seen = [0] * (n+1)

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

def dfs(v):
    seen[v] = 1
    print(v, end=' ')
    for i in range(1, n+1):
        if matrix[v][i] == 1 and seen[i] == 0:
            dfs(i)

def bfs(v):
    queue = collections.deque()
    queue.append(v)
    seen[v] = 1

    while queue:
        v = queue.popleft()
        print(v, end=' ')
        for i in range(1, n+1):
            if matrix[v][i]==1 and seen[i] == 0:
                queue.append(i)
                seen[i]=1

dfs(v)
seen = [0] * (n+1)
print()
bfs(v)