목록너비 우선 탐색 (3)

DevLog:-)

[알고리즘][파이썬]1697-숨바꼭질

문제 코드 import sys from collections import deque n, k = map(int,sys.stdin.readline().strip().split()) def bfs(): q = deque() q.append(n) while q: v = q.popleft() if v == k: print(visited[v]) break for nv in (v - 1, v + 1, v * 2): if 0
알고리즘/백준 2023. 5. 26. 02:16
[알고리즘][파이]1260-DFS와 BFS ✅

문제 코드 import sys from collections import deque N,M,V = map(int,sys.stdin.readline().strip().split()) graph =[[] for _ in range(N+1)] def dfs(cur_v): visited.append(cur_v) for v in graph[cur_v]: if(v not in visited): dfs(v) return visited def bfs(start_v): visited=[start_v] q = deque() q.append(start_v) while(q): cur_v =q.popleft() for v in graph[cur_v]: if(v not in visited): visited.append(v) q...
알고리즘/백준 2023. 5. 16. 23:25
[알고리즘][파이썬]2606-바이러스

문제코드BFSimport sysfrom collections import dequen = int(sys.stdin.readline())m = int(sys.stdin.readline())graph=[[] for _ in range(n+1)]def bfs(start_v): visited=[start_v] q =deque() q.append(start_v) while(q): cur_v=q.popleft() for v in graph[cur_v]: if(v not in visited): visited.append(v) q.append(v) re..
알고리즘/백준 2023. 5. 16. 23:17
이전 Prev 1 Next 다음