� Study: 네트워크 (#54)

Author: yongjun-0903

yongjun-0903/네트워크.py

@@ -0,0 +1,13 @@
+def solution(n, computers):
+    network = 0
+    graph = {}
+    for i in range(n):
+        if i not in graph:
+            graph[i] = []
+        for j in range(n):
+            if i != j and computers[i][j] == 1:
+                graph[i].append(j)
+    print(graph)
+    
+    visited = [False for _ in range(n)]
+    print(visited)