[프로그래머스] / [Level 3] / [Python] 네트워크 - DFS/BFS

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

프로그래머스

---

BFS를 활용하여 해결하였다.

from collections import deque
   
def solution(n, computers):
    def bfs(i, computers, n):
        visited[i] = True
        
        q = deque()
        q.append(i)
        
        while q:
            pop = q.popleft()
            visited[pop] = True
            
            for j in range(n):
                if computers[pop][j] == 1:
                    if visited[j] == False:
                        q.append(j)

    answer = 0
    visited = [False for _ in range(n)]    
    
    for i in range(n):
        if visited[i] == False:
            bfs(i, computers, n)
            answer += 1
    
    return answer

 

추가 입출력 예

print(solution(3, [[1, 1, 0], 
                   [1, 1, 0],
                   [0, 0, 1]])) # 2

print(solution(3, [[1, 1, 0], 
                   [1, 1, 1], 
                   [0, 1, 1]])) # 1

print(solution(4, [[1, 1, 1, 0], 
                   [1, 1, 1, 0], 
                   [1, 1, 1, 0],
                   [0, 0, 0, 1]])) # 2

print(solution(7, [[1, 0, 0, 0, 0, 0, 1], 
                   [0, 1, 1, 0, 1, 0, 0], 
                   [0, 1, 1, 1, 0, 0, 0], 
                   [0, 0, 1, 1, 0, 0, 0], 
                   [0, 1, 0, 0, 1, 1, 0], 
                   [0, 0, 0, 0, 1, 1, 1], 
                   [1, 0, 0, 0, 0, 1, 1]])) # 1