https://school.programmers.co.kr/learn/courses/30/lessons/43162
from collections import deque
def solution(n, computers):
answer = 0
visited = [0]*n
for i in range(n):
if visited[i] == 0:
answer += 1
visited[i] = 1
dq = deque([i])
while dq:
loc = dq.popleft()
for j in range(n):
if computers[loc][j] == 1 and visited[j] == 0:
visited[j] = 1
dq.append(j)
return answer
#BFS