[프로그래머스 lv3] 네트워크 (dfs/파이썬)

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

answer = 0

def dfs(node, computers, Visit, path):
    global answer
    Visit[node] = True
    path.append(node)
    for i in range(len(computers[node])):
        if computers[node][i] == 1 and not Visit[i]: 
            dfs(i, computers, Visit, path)
    return path

def solution(n, computers):
    global answer
    Visit = [False for _ in range(n)]
    Group = []
    for i in range(n):
        if not Visit[i]:
            Group.append(dfs(i, computers, Visit, []))
            
    # print(Group)
    return len(Group)