Method compare

DijkstraAlgorithm.java:15–17

(int p1[], int p2[])

        // [node, dist]
        PriorityQueue<int[]> pq = new PriorityQueue<>(new Comparator<int[]>(){
            public int compare(int p1[], int p2[]){
                return p1[1] - p2[1];
            }
        });
        int dist[] = new int[V];
        Arrays.fill(dist,Integer.MAX_VALUE);