Method printGraph

contents/algorithm/code/DijkstraTest.java:130–136

()

    }

    public void printGraph() {
        for (int i = 1; i <= N; i++) {
            for (Node n : graph[i]) {
                System.out.println(i + " --" + n.distance + "--> " + n.index);
            }
        }
    }

    public void getShortestDistance(int S) {
        PriorityQueue<Node> pq = new PriorityQueue<>(((o1, o2) -> o1.distance - o2.distance));