def solution(n, computers):
answer = 0
is_visit = [False for _ in range(n)]
for com in range(n):
if is_visit[com] == False:
DFS(n, computers, com, is_visit)
answer += 1
return answer
def DFS(n, computers, com, is_visit):
is_visit[com] = True
for connect in range(n):
if connect != com and computers[com][connect] == 1:
if is_visit[connect] == False:
DFS(n, computers, connect, is_visit)