network_bfs.py

from collections import deque
q = deque()

def bfs(index, computers):
  q.append(index)
  while not (len(q) == 0):
    i = q.popleft()
    computers[i][i] = 0

    for z in range(len(computers[i])):
      if computers[i][z] == 1:
        q.append(z)
        computers[i][z] = 0
        computers[z][i] = 0

def solution(n, computers):
  network_count = 0
  for i in range(len(computers)):
    if sum(computers[i]) > 0 :
      bfs(i, computers)
      network_count = network_count+1
  
  return network_count

computers = [
  [1,1,0],
  [1,1,1],
  [0,1,1]
]

print(solution(3, computers)) # 1