[깊이/너비 우선 탐색(DFS/BFS)] 네트워크

https://programmers.co.kr/learn/courses/30/lessons/43162

코딩테스트 연습 - 네트워크

 

def solution(n, computers):
    visited = [0 for i in range(n)]
    answer = 0
    
    def DFS(arg):
        visited[arg] = 1
        for i in range(n):
            if computers[arg][i] and not visited[i]:
                DFS(i)
                
    for c in range(n):
        if visited[c] == 1:
            continue
        answer += 1
        DFS(c)
    return answer