}
private static void testShortestPaths() {
int[][] neighbors = { { 1, 5 }, { 2 }, { 3, 5 }, {}, { 3 }, { 4, 1 } };
double[][] weights = { { 4, 2 }, { 3 }, { 0, 0 }, {}, { 3 }, { 2, 1 } };
WeightedGraph graph = new WeightedGraph(neighbors, weights);
ShortestPaths sssp = new ShortestPaths();
double[] delta = sssp.computeShortestPaths(graph, 0);
}