[프로그래머스 lv 3] 네트워크(깊이/너비 우선 탐색(DFS/BFS))

아이디어 : DFS로 풀면 될 것 같다.

def dfs(visited, computers, i):
    if visited[i] == True:
        return 0
    else:
        visited[i] = True
        for node in range(len(computers[i])):
            if computers[i][node]==1:
                dfs(visited, computers, node)
        return 1
    
def solution(n, computers):
    answer = 0
    visited = [False] * n
    for i in range(len(computers)):
        answer+= dfs(visited, computers, i)
    return answer