네트워크

class Solution {
    public static int[][] map;
    public static int nn;
    public static boolean visited[];
    public int solution(int n, int[][] computers) {
       
        int answer = 0;
        this.map = computers;
        this.nn = n;
        
        visited = new boolean[n];
    
        for(int i=0; i<n; i++){
          
            if(!visited[i]){
                  answer++;
                dfs(i);
            }
        }
        return answer;
    }
    
    public  void dfs(int start){
        visited[start] = true;
        for(int i=0; i<nn; i++){
            if(!visited[i]&&map[start][i]==1){
                dfs(i);
            }
        }
    }
}