🦕 공룡이 되자!

전체 코드 from collections import deque N, M, V=map(int,input().split()) matrix=[[0]*(N+1) for i in range(N+1)] visited=[False]*(N+1) for i in range(M): x,y=map(int,input().split()) matrix[x][y]=matrix[y][x]=1 def dfs(matrix,V,visited): visited[V]=True print(V,end=' ') for i in range(1,N+1): if not visited[i]and matrix[V][i]==1: dfs(matrix,i,visited) def bfs(matrix,V,visited): queue=deque([V]) visit..