kyg8821

해커톤 인원 모집(디자이너)

네트워크를 공부한 후

고민있어요 ㅠㅠ

<pre><code class="language-python">import sys
import collections
sys.setrecursionlimit(10**6)
input = sys.stdin.readline

N, M = map(int, input().split())

dic = collections.defaultdict(list)
visited = []
result = 0

for _ in range(M):
    x, y = map(int, input().split())
    dic[x].append(y)
    dic[y].append(x)


def dfs(node):
    global visited, dic
    visited.append(node)

    for n in dic[node]:
        if n not in visited:
            dfs(n)


for node in list(dic.keys()):
    if node not in visited:
        dfs(node)
        result += 1

print(result)</code></pre>

kyg8821

Posts