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

 

📌문제

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

 

🎖️난이도

Level 3

 

✔️풀이

# dfs
def solution(n, computers):
    visited = [False] * n
    stack = []
    cnt = 0
    
    for i in range(len(visited)):
        if visited[i] == False:
            cnt += 1
            stack.append(i)
            
            while stack:
                now = stack.pop()
                if visited[now] == False:
                    visited[now] = True
                    for i in range(n):
                        if computers[now][i] == 1 and i != now:
                            stack.append(i)
                
    return cnt

 

🧠노트

- 

 

🔍참고

-