dfs, bfs - 네트워크 / 파이썬

dfs 풀이

def solution(n, computers):
    visit = [0] * n
    def dfs(com):
        visit[com] = 1
        for idx, num in enumerate(computers[com]):
            if idx == com or visit[idx] or num == 0: continue
            dfs(idx)
    answer = 0
    for i in range(n):
        if visit[i] == 0:
            dfs(i)
            answer += 1
    return answer

 

bfs 풀이

from collections import deque

def solution(n, computers):
    answer = 0
    visit = [0] * n
    for i in range(n):
        if visit[i]: continue
        q = deque()
        q.append(i)
        while q:
            cur = q.popleft()
            visit[cur] = 1
            for idx, val in enumerate(computers[cur]):
                if visit[idx] or val == 0 or idx == cur: continue
                q.append(idx)
        answer += 1
    return answer

 

programmers.co.kr/learn/courses/30/lessons/43162

코딩테스트 연습 - 네트워크