백준 풀이
백준 11724번 파이썬 (dfs)
ag2개발자
2022. 8. 29. 20:19
dfs
def dfs(v):
for j in g[v]:
if visited[j]:
continue
visited[j]=1
dfs(j)
n,m = map(int,input().split())
g=[[] for _ in range(n+1)]
cnt=0
visited = [0]*(n+1)
for i in range(m):
a,b= map(int,input().split())
g[a].append(b)
g[b].append(a)
for i in range(1,n+1):
if not visited[i]:
dfs(i)
cnt+=1
print(cnt)