function solution(n, computers) {
let cnt = 0;
let ch=Array(n).fill(0);
let queue=[];
for(let i=0;i<computers.length;i++){
for(let j=0;j<computers[i].length;j++){
if(computers[i][j]&&!ch[i]){
queue.push(i);
ch[i]=1;
while(queue.length){
let x=queue.shift();
for(let k=0;k<n;k++){
if(computers[x][k]&&!ch[k]){
queue.push(k);
ch[k]=1;
}
}
}
cnt++;
}
}
}
return cnt;
}