그래프

🥈 Silver1https://www.acmicpc.net/problem/1697  메모리실행시간40316KB252ms  ✅ 정답풀이import sysfrom collections import dequeinput = sys.stdin.readline# 최단경로 찾기=최단시간 찾기 (bfs)def bfs(start,target): global cur queue=deque([start]) visited[start]=0 #시작점은 이동거리=0 while queue: cur=queue.popleft() if cur==target: return visited[cur] for i in range(3): if i 수빈..

🥈 Silver1https://www.acmicpc.net/problem/21937  ✅ 정답코드import sysinput = sys.stdin.readlinedef dfs(idx): stack.append(idx) visited[idx] = True while stack: cur = stack.pop() for i in graph[cur]: if not visited[i]: stack.append(i) visited[i] = True answer.add(i)n, m = map(int, input().strip().split())graph = [[] fo..

🥈Silver2https://www.acmicpc.net/problem/2644   ✅ 정답풀이import sysfrom collections import dequeinput = sys.stdin.readlinedef bfs(start,end): queue=deque([start]) visited[start]=0 # 시작지점: 거리 0 while queue: cur=queue.popleft() # 목표 지점 도달하면 거리 반환 if cur==end: return visited[cur] # 인접 노드 방문 for neighbor in graph[cur]: if visit..