import java.util.*;
class Solution {
    static boolean visited[];
    static List<List<Integer>> adjList;
    static Queue<Integer> queue;
    static int count = 0;
    public int solution(int n, int[][] computers) {
        int answer = 0;
        visited = new boolean[n];
        adjList = new ArrayList<>();
        for(int i=0; i<n; i++){
            adjList.add(new ArrayList<Integer>());
        }
        for(int i=0; i<n; i++){
            for(int j=0; j<n; j++){
                if(i==j){
                    continue;
                }
                if( computers[i][j]==1){
                    adjList.get(i).add(j);
                }
            }
        }
        for(int i=0; i<n; i++){
            if(visited[i] == false){
                dfs(i);
                count++;
            }
        }
        return count;
    }
    public void bfs(int x){
        queue = new LinkedList<>();
        queue.offer(x);
        visited[x] = true;
        
        while(!queue.isEmpty()){
            int a = queue.poll();
            List<Integer> list = adjList.get(a);
            for(int i=0; i<list.size(); i++){
                int v = list.get(i);
                if(visited[v]==false){
                    queue.offer(v);
                    visited[v] = true;
                }
            }
        }
    }
    
    public void dfs(int x){
        if(visited[x]) {return;}
        visited[x] = true;
        List<Integer> list = adjList.get(x);
        for(int i=0; i<list.size(); i++){
            int v = list.get(i);
            if(visited[v] == false){
                dfs(v);
            }
        }
    }
}