Method compare

modifiedGraphEdges.java:59–61

(int a[], int b[])

        // [u,w] (node, weight to node)
        PriorityQueue<int[]> queue = new PriorityQueue<>(new Comparator<int[]>(){
            public int compare(int a[], int b[]){
                return a[1] - b[1];
            }
        });

        Arrays.fill(minDistance, INF);