[Baekjoon] 백준 11724 연결 요소의 개수 Python

https://www.acmicpc.net/problem/11724

 

import sys
sys.setrecursionlimit(10**6)

# 전역변수
n, m = map(int, sys.stdin.readline().split())

graph = [[] for _ in range(n+1)]
visited = [0] * (n+1)
cnt = 0

# 함수
def dfs(graph, visited, v):
    visited[v] = 1
    for i in graph[v]:
        if not visited[i]:
            dfs(graph, visited, i)


# 구현부
for _ in range(m):
    a, b = map(int, sys.stdin.readline().split())
    graph[a].append(b)
    graph[b].append(a)

for i in range(1, n+1):
    if not visited[i]:
        dfs(graph, visited, i)
        cnt+=1

print(cnt)