def DFS(node, computers, visited):
visited[node] = 1
for i in range(len(visited)):
if computers[node][i]==1 and visited[i]==0: DFS(i, computers, visited)
def solution(n, computers):
cnt, visited = 0, [0]*n
for i in range(n):
if visited[i]==0:
DFS(i, computers, visited)
cnt += 1
return cnt
