[프로그래머스] 네트워크

DFS로 푼 문제.

코테에도 DFS & BFS 이정도로만 나와주면 안되나요..?

 

graph = []
def dfs(x, visited):
    if visited[x] == 0:
        visited[x] = 1
        for i in range(len(graph)):
            if graph[x][i] == 1 and i != x:
                dfs(i, visited)
        return True
    return False

def solution(n, computers):
    answer = 0
    for i in range(n):
        graph.append(computers[i])
    visited = [0] * n
    for i in range(n):
            if dfs(i, visited) == True:
                answer = answer + 1
    return answer