1. ํ์์ ์ํํ ์ค๋น
def solution(n, computers):
visited = [0] * n
answer = 0
for i in range(n):
if visited[i] == 0:
<DFS ํจ์๊ฐ ๋ค์ด๊ฐ ์์น>
answer += 1
return answer
2. DFS ํจ์ ๊ตฌํ
def dfs(k, graph, visited):
visited[k] = 1
for i in range(len(graph[k])):
if visited[i] == 0 and graph[k][i] and graph[k][i] == 1:
dfs(i, graph, visited)
def dfs(k, graph, visited):
visited[k] = 1
for i in range(len(graph[k])):
if visited[i] == 0 and graph[k][i] and graph[k][i] == 1:
dfs(i, graph, visited)
def solution(n, computers):
visited = [0] * n
answer = 0
for i in range(n):
if visited[i] == 0:
dfs(i, graph, visited)
answer += 1
return answer