[백준온라인저지] 1260 - DFS와 BFS

---

 

 

https://www.acmicpc.net/problem/1260

1260번: DFS와 BFS

import sys

def dfs(v):
    print(v, end=' ')
    visit[v] = 1

    for i in range(1, n+1):
        if visit[i] == 0 and s[v][i] == 1:
            dfs(i)

def bfs(v):
    queue = [v]
    visit[v] = 0

    while queue:
        v = queue[0]
        print(v, end=' ')
        del queue[0]

        for i in range(1, n+1):
            if visit[i] == 1 and s[v][i] == 1:
                queue.append(i)
                visit[i] = 0

n, m, v = map(int, sys.stdin.readline().split())

s = [ [0] * (n+1) for i in range(n+1)]
visit = [ 0 for i in range(n+1)]

for i in range(m):
    x, y = map(int, sys.stdin.readline().split())

    s[x][y] = 1
    s[y][x] = 1

dfs(v)
print()
bfs(v)