알고리즘: 백준 11724번 연결 요소의 개수 (feat.python)

 

11724번: 연결 요소의 개수

import sys
read = sys.stdin.readline
n, m = map(int, read().split())
graph = {}
for i in range(n):
    graph[i+1] = []
for _ in range(m):
    u, v = map(int, read().split())
    graph[u].append(v)
    graph[v].append(u)


global count
count = 0
visit = []

def dfs(start):
    if start in visit:
        return
    global count
    stack = [start]

    count += 1
    while stack:

        node = stack.pop()
        if not node in visit:
            visit.append(node)
            for i in graph[node]:
                stack.append(i)
for i in range(n):
    dfs(i+1)

print(count)