Algorithm_with_python/43162.py at master · JeonJoonHo/Algorithm_with_python · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
# https://programmers.co.kr/learn/courses/30/lessons/43162?language=python3

def DFS(graph, root, connect, current_network):
    visited = []
    stack = [root]

    while stack:
        current = stack.pop()
        if current not in visited:
            visited.append(current)
            connect[current] = current_network
            stack += graph[current] - set(visited)
    return visited


def solution(n, computers):
    connect = [0] * (n + 1)

    graph_list = {}
    for i in range(n):
        connection_list = set()
        for j in range(n):
            if i == j:
                continue
            if computers[i][j] == 1:
                connection_list.add(j + 1)

        graph_list[i + 1] = connection_list

    network_number = 0
    for key, value in graph_list.items():
        if connect[key] > 0:
            continue
        network_number += 1
        DFS(graph_list, key, connect, network_number)

    return network_number

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