프로그래머스 네트워크

#dfs 풀이 1
graph = []

def solution(n, computers):
    global graph
    graph = [[] for i in range(n)]
    
    for i in range(n):
        for j in range(n):
            if i != j and computers[i][j] == 1:
                graph[i].append(j)
    visited = [False] * n
    answer = 0
    for i in range(n):
        if not visited[i]:
            dfs(visited,computers,i)
            answer +=1       
    return answer

def dfs(visited, computers, x):
    visited[x] = True
    for i in graph[x]:
        if not visited[i]:
            dfs(visited, computers,i)

 

#dfs 풀이2
N = 0
def solution(n, computers):
    global N
    N = n
    visited = [False] * n
    answer = 0
    for i in range(n):
        if not visited[i]:
            dfs(visited,computers,i)
            answer +=1           
    return answer

def dfs(visited, computers, x):
    visited[x] = True
    for i in range(0,N):
        if computers[x][i] == 1 and not visited[i]:
            dfs(visited, computers,i)