네트워크 (BFS)

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

프로그래머스

 

def solution(n, computers):
    answer = 0
    visited=[False]*n

    
    def BFS(v):
        queue=[]
        visited[v]=True
        queue.append(v)

        while queue:
            now=queue.pop(0)
            visited[now]=True

            for i in range(n):
                if i!=now and not visited[i] and computers[now][i]==1:
                    queue.append(i)

    for x in range(n):
        if not visited[x]:
            BFS(x)
            answer+=1
            
    return answer