조예지

from collections import deque def bfs(n, computers, par): queue = deque() queue.append(n) while queue: now = queue.popleft() for i in range(len(computers[now])): if computers[now][i] == 1 and i != now and par[i] == i: queue.append(i) par[i] = now def solution(n, computers): par = [i for i in range(len(computers))] cnt = 0 for i in par: if par[i] == i: bfs(i, computers, par) cnt += 1 return cnt