@@ -0,0 +1,1514 @@
+package com.test.graphs;%0A%0Aimport java.util.LinkedList;%0A%0Aimport com.graphs.GraphAdjacencyListRepresentation;%0Aimport com.graphs.ShortestPathWithDijkstra;%0A%0Aimport junit.framework.TestCase;%0A%0Apublic class TestShortestPathWithDijkstra extends TestCase%7B%0A%0A    public void testShortestPathWithDijkstra() %7B%0A        %0A        GraphAdjacencyListRepresentation graph = new GraphAdjacencyListRepresentation(13, true);%0A        graph.addEdge(0, 5, 3);%0A        graph.addEdge(0, 1, 9);%0A%0A        graph.addEdge(2, 0, 2);%0A        graph.addEdge(2, 3, 15);%0A%0A        graph.addEdge(3, 5, 14);%0A        graph.addEdge(3, 2, 8);%0A%0A        graph.addEdge(4, 3, 44);%0A        graph.addEdge(4, 2, 6);%0A%0A        graph.addEdge(5, 4, 1);%0A%0A        graph.addEdge(6, 4, 2);%0A        graph.addEdge(6, 8, 3);%0A        graph.addEdge(6, 0, 11);%0A        graph.addEdge(6, 9, 23);%0A%0A        graph.addEdge(7, 6, 9);%0A%0A        graph.addEdge(8, 6, 3);%0A%0A        graph.addEdge(9, 11, 8);%0A        graph.addEdge(9, 10, 5);%0A%0A        graph.addEdge(10, 12, 17);%0A%0A        graph.addEdge(11, 12, 33);%0A%0A        graph.addEdge(12, 9, 10);%0A%0A        ShortestPathWithDijkstra sp = new ShortestPathWithDijkstra(graph, 6);%0A        assertEquals(0, sp.getShortestDistance(6));%0A        assertEquals(23, sp.getShortestDistance(3));%0A        %0A        LinkedList%3CInteger%3E pathTo3 = new LinkedList%3C%3E();%0A        pathTo3.add(6);%0A        pathTo3.add(4);%0A        pathTo3.add(2);%0A        pathTo3.add(3);%0A        %0A        assertEquals(true, pathTo3.equals(sp.getShortestPath(3)));%0A        %0A    %7D%0A    %0A%7D%0A

Add JUnit test for ShortestPathWithDijkstra