[알고리즘] 프로그래머스 네트워크 / python, dfs

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

프로그래머스

 

 

 

def solution(n, computers):
    answer = 0
    visit = [0] * n
    
    def dfs(computers, visit, s):
        stack = [s]
        while stack:
            temp = stack.pop()
            visit[temp] = 1
            for i in range(len(visit)):
                if computers[temp][i] == 1 and visit[i] == 0:
                    stack.append(i)
                    dfs(computers, visit, i)
        
    s = 0
    while 0 in visit:
        if visit[s] == 0:
            dfs(computers, visit, s)
            answer += 1
        s += 1
    
    return answer