[프로그래머스] 네트워크

https://velog.io/@ajufresh/%ED%94%84%EB%A1%9C%EA%B7%B8%EB%9E%98%EB%A8%B8%EC%8A%A4-%EB%84%A4%ED%8A%B8%EC%9B%8C%ED%81%AC-%EB%AC%B8%EC%A0%9C%ED%92%80%EC%9D%B4-Java

[프로그래머스] 네트워크 문제풀이 (Java)

 

재귀함수를 통한 DFS

 

참고한 풀이

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]){
                dfs(computers, visited, i);
                answer++;
            }
        }
        
        return answer;
    }
    
    
    public void dfs(int[][]computers, boolean[]visited, int v){
        visited[v] = true;
        for(int j=0; j<computers.length; j++){
            if(computers[v][j]==1 && !visited[j]){
                dfs(computers, visited, j);
            }
        }
    }
    
}