[백준/BOJ] 1260번 DFS와 BFS (Python)

[백준/BOJ] 1260번 DFS와 BFS

www.acmicpc.net/problem/1260

1260번: DFS와 BFS

이 문제는 dfs와 bfs문제의 가장 기본문제 같다.

 

Python code

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

def bfs(v, n, matrix, check):
  queue=[v]
  check[v]=True
  while queue:
    v=queue.pop(0)
    print(v, end=' ')
    for i in range(1, n+1):
      if not check[i] and matrix[v][i]==1:
        queue.append(i)
        check[i]=True

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

dfs(v, n, matrix, [False]*(n+1))
print()
bfs(v, n, matrix, [False]*(n+1))