PROGRAMMERS 43162: 네트워크

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

---

Python

def DFS(node, network, link_data, value):
    for i in link_data[node]:
        if i in network:
            if network[i] == -1:
                network[i] = value
                DFS(i, network, link_data, value)
 
 
def solution(n, computers):
    global map_size
    map_size = n
    node_data = dict()
    network = dict()
    for i in range(n):
        network[i] = -1
    for y in range(n):
        for x in range(n):
            if x != y and computers[y][x] == 1:
                if x not in node_data:
                    node_data[x] = {y}
                else:
                    node_data[x].add(y)
                if y not in node_data:
                    node_data[y] = {x}
                else:
                    node_data[y].add(x)
    counter = 0
    for i in range(n):
        if i in node_data:
            DFS(i, network, node_data, i)
    result = dict()
    for i in network:
        if network[i] == -1:
            counter += 1
        else:
            result[network[i]] = 0
    return counter + len(result)

FeedBack

1. 소스가 최적화가 안되어있어 굉장히 복잡합니다. 추후 보강이 필요합니다.

---

 

 

 

cjw.git@gmail.com