@@ -0,0 +1,916 @@
+package dijkstras;%0A%0Aimport dijkstras.Dijkstras;%09%09// My implementation of Dijkstras algorithm in package dijkstras%0A%0A/*%0A%09This class test Dijkstras shortest path algorithm%0A*/%0A%0Aclass TestDijkstras%0A%7B%0A%0A%0A%09// Test A%0A%0A%09public static void testA()%7B%0A%0A%09%09int N = 6;%09%09// No. of vertices%0A%09%09int M = 10;%09%09// No. of edges%0A%09%09int edges%5B%5D%5B%5D = %7B%09%7B1,2,10%7D, %09%09// Edges%0A%09%09%09%09%09%09%09%7B2,3,1%7D,%0A%09%09%09%09%09%09%09%7B3,4,4%7D,%0A%09%09%09%09%09%09%09%7B4,3,6%7D,%0A%09%09%09%09%09%09%09%7B5,4,2%7D,%0A%09%09%09%09%09%09%09%7B1,5,5%7D,%0A%09%09%09%09%09%09%09%7B2,5,2%7D,%0A%09%09%09%09%09%09%09%7B5,2,3%7D,%0A%09%09%09%09%09%09%09%7B5,3,9%7D,%0A%09%09%09%09%09%09%09%7B4,1,7%7D%0A%09%09%09%09%09%09%7D;%0A%0A%09%09int s = 1;%09%09// source vertex%09%09%09 %09%0A%0A%09%09Dijkstras dk = new Dijkstras(N, M, edges, s);%09%09%09%09%0A%0A%09%09dk.findShortestPaths();%0A%0A%09%09System.out.println(%22Shortest Distances: %22);%0A%09%09dk.showDist();%0A%0A%09%09System.out.println(%22Shortest Paths: %22);%0A%09%09for(int i=1;i%3C=N;i++)%7B%0A%09%09%09%0A%09%09%09System.out.print(i+ %22: %22);%0A%09%09%09dk.printPath(i);%0A%09%09%09System.out.println();%0A%09%09%7D%0A%0A%09%7D%09%0A%0A%0A%0A%09public static void main(String args%5B%5D)%7B%0A%0A%09%09%09// Call testA() %0A%0A%09%09%09testA();%0A%09%7D%0A%7D%09

Add test class for dijkstras algorithm