파이썬 프로그래머스 네트워크(DFS 문제 풀이)

def dfs(computers, visited, start, n):
    visited[start] = 1
    for node in range(n):
        if(computers[start][node]==1 and visited[node]==0):
            dfs(computers, visited, node, n)

def solution(n, computers):
    answer = 0
    visited = [0] * n
    for start in range(n):
        if visited[start] == 0:
            dfs(computers, visited, start, n)
            answer+=1
    
    return answer