문제

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

나의 코드

"""

"""

from collections import deque

def solution(n, computers):
    answer = 0
    
    visited = [False] * n
    
    def bfs(v):
        visited[v] = True
        q = deque([v])
        
        while q:
            v = q.popleft()
            
            for j in range(n):
                if computers[v][j] and not visited[j]:
                    visited[j] = True
                    q.append(j)
                
    for i in range(n):
        if not visited[i]:
            bfs(i)
            answer += 1
            
    return answer     
    
    

설명

간단한 BFS문제

참고 자료