네트워크

class Solution {
    static boolean visited[];
    public static void DFS(int pos, int n, int[][] computers) {
        if(visited[pos])
            return;
        visited[pos] = true;
        for(int i=0;i<n;i++) {
            if(i == pos)
                continue;
            if(computers[pos][i] == 1) 
                DFS(i, n, computers);
        }
    }
    public int solution(int n, int[][] computers) {
        int answer = 0;
        visited = new boolean[n];
        
        for(int i=0;i<n;i++) {
            if(!visited[i]) {
                answer++;
                DFS(i, n, computers);
            }
        }
        return answer;
    }
}