'BFS' 태그의 글 목록

문제: 코드 : import sys from collections import deque # 방문 : 1 & 방문x : 0 def DFS(V): visited_dfs[V] = 1 print(V, end= ' ') for i in range(1, N+1): if visited_dfs[i] == 0 and graph[V][i]==1: DFS(i) def BFS(V): queue = deque([V]) visited_bfs[V] = 1 while queue: V = queue.popleft() print(V, end= ' ') for i in range(1, N+1): if visited_bfs[i] == 0 and graph[V][i] == 1: queue.append(i) visited_bfs[i] = 1..

Programming/백준 2024. 2. 10. 23:33

이전 1 다음