Class DijkstraTest

contents/algorithm/code/DijkstraTest.java:4–34

import java.util.PriorityQueue;

public class DijkstraTest {

    static int[][] weights = {
            {1, 2, 7},
            {1, 3, 5},
            {1, 4, 3},
            {3, 4, 3},
            {3, 5, 3},
            {4, 5, 9},
            {4, 7, 7},
            {5, 3, 2},
            {5, 7, 1},
            {6, 2, 3},
            {6, 4, 1},
            {6, 7, 7}
    };

    public static void main(String[] args) {
        /* Simple Dijkstra */
        Dijkstra d = new Dijkstra(7);
        for (int[] w : weights) d.setGraph(w[0], w[1], w[2]);
//        d.printGraph();
        d.getShortestDistance(1);

        /* Improved Dijkstra */
        ImprovedDijkstra d2 = new ImprovedDijkstra(7);
        for (int[] w : weights) d2.setGraph(w[0], w[1], w[2]);
//        d2.printGraph();
        d2.getShortestDistance(1);
    }
}

class Dijkstra {
    private int N;