[프로그래머스][JAVA] 전력망을 둘로 나누기 (그래프)

import java.util.*;
 
class Solution {
    private static List<Node> nodeList;
    private static boolean[][] visited;
    
    public int solution(int n, int[][] wires) {
        int answer = Integer.MAX_VALUE;
        nodeList = new ArrayList<>();
        
        
        for(int i=0; i<=n; i++){
            nodeList.add(new Node(i));
        }
        
        for(int[] wire : wires){
            int a = wire[0];
            int b = wire[1];
            
            nodeList.get(a).edgeList.add(b);
            nodeList.get(b).edgeList.add(a);
        }
        
        for(int[] wire : wires){
            int a = wire[0];
            int b = wire[1];
            
            nodeList.get(a).edgeList.remove(new Integer(b)); 
            nodeList.get(a).edgeList.remove(new Integer(a));
            
            visited = new boolean[n+1][n+1];
            int nodeCandiNum = BFS(a);
            // System.out.println(nodeCandiNum);
            answer = Math.min(answer, Math.abs(2*nodeCandiNum-n));
            
            
            nodeList.get(a).edgeList.add(b);
            nodeList.get(b).edgeList.add(a);
        }
        
        
        return answer;
    }
    
    private class Node{
        int num;
        List<Integer> edgeList;
        
        public Node(int num){
            this.num = num;
            edgeList = new ArrayList<>();
        }
        
    }
    
    private int BFS(int num){
        
        int ret = 0;
        Queue<Node> q = new LinkedList<>();
        q.offer(nodeList.get(num));
        
        
        while(!q.isEmpty()){
            Node node = q.poll();
            int currNum = node.num;
            List<Integer> edgeList = node.edgeList;
            ret++;
            // System.out.print(currNum+" ");
    
            for(int i=0; i<edgeList.size(); i++){
                int nodeNum = edgeList.get(i);
                if(!visited[currNum][nodeNum]){
                    q.offer(nodeList.get(nodeNum));
                    visited[currNum][nodeNum] = true;
                    visited[nodeNum][currNum] = true;
                }
            }
        }
        
        return ret;
    }
}