[JAVA] 전력망을 둘로 나누기

import java.util.*;
class Solution {
    int[][] arr;
    public int solution(int n, int[][] wires) {
        int answer = n;
        arr= new int[n+1][n+1];
        
        for(int i=0;i<wires.length;i++){
            arr[wires[i][0]][wires[i][1]]=1;
            arr[wires[i][1]][wires[i][0]]=1;
        }
        //모든 간선 한번씩 끊어서 비교.
        for(int i=0;i<wires.length;i++){
            arr[wires[i][0]][wires[i][1]]=0;
            arr[wires[i][1]][wires[i][0]]=0;
            int start=wires[i][0];
            answer=Math.min(answer,bfs(n,start));
 
            arr[wires[i][0]][wires[i][1]]=1;
            arr[wires[i][1]][wires[i][0]]=1;
        
        }
        
        return answer;
    }
    
    public int bfs(int n, int start){
        Queue<Integer> q=new LinkedList<>();
        int[] visited=new int[n+1];
        int cnt=1;
        q.add(start);
        visited[start]=1;
        while(!q.isEmpty()){
            int cur=q.poll();
            
            for(int i=1;i<=n;i++){
                if( (arr[cur][i]==1) && (visited[i]==0) ){
                    cnt++;
                    visited[i]=1;
                    q.add(i);                    
                }
            }
        }
        return Math.abs(n-2*cnt);
    }
}

출처:https://school.programmers.co.kr/learn/courses/30/lessons/86971