[파이썬🐍] 프로그래머스 : 네트워크
def solution(n, computers): answer = 0 visited = [False for i in range(n)] for com in range(n): if visited[com] == False: DFS(n,computers,com,visited) answer += 1 return answer def DFS(n,computers,com,visited): visited[com] = True for connect in range(n): if connect != com and computers[com][connect] == 1: if visited[connect] == False: DFS(n,computers, connect, visited) def solution(n, computers..
2021. 7. 17.