Method main

contents/algorithm/code/DijkstraTest.java:21–33

(String[] args)

    };

    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 {