programmers_네트워크_java

https://school.programmers.co.kr/learn/courses/30/lessons/43162

프로그래머스

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