Method compare

PrimsAlgorithm.java:10–12

(int pair1[], int pair2[])

        //(parent, node, weight)
        PriorityQueue<int[]> pq = new PriorityQueue<>(new Comparator<>(){
            public int compare(int pair1[], int pair2[]){
                return pair1[2] - pair2[2];
            }
        });
        int sum=0;
        ArrayList<int[]> edges = new ArrayList<>();