1.1 --- a/test/heap_test.cc Sun Jul 13 20:09:47 2008 +0100
1.2 +++ b/test/heap_test.cc Mon Jul 14 09:15:23 2008 +0200
1.3 @@ -54,27 +54,27 @@
1.4 "8\n"
1.5 "9\n"
1.6 "@arcs\n"
1.7 - " label capacity\n"
1.8 - "0 5 0 94\n"
1.9 - "3 9 1 11\n"
1.10 - "8 7 2 83\n"
1.11 - "1 2 3 94\n"
1.12 - "5 7 4 35\n"
1.13 - "7 4 5 84\n"
1.14 - "9 5 6 38\n"
1.15 - "0 4 7 96\n"
1.16 - "6 7 8 6\n"
1.17 - "3 1 9 27\n"
1.18 - "5 2 10 77\n"
1.19 - "5 6 11 69\n"
1.20 - "6 5 12 41\n"
1.21 - "4 6 13 70\n"
1.22 - "3 2 14 45\n"
1.23 - "7 9 15 93\n"
1.24 - "5 9 16 50\n"
1.25 - "9 0 17 94\n"
1.26 - "9 6 18 67\n"
1.27 - "0 9 19 86\n"
1.28 + " label capacity\n"
1.29 + "0 5 0 94\n"
1.30 + "3 9 1 11\n"
1.31 + "8 7 2 83\n"
1.32 + "1 2 3 94\n"
1.33 + "5 7 4 35\n"
1.34 + "7 4 5 84\n"
1.35 + "9 5 6 38\n"
1.36 + "0 4 7 96\n"
1.37 + "6 7 8 6\n"
1.38 + "3 1 9 27\n"
1.39 + "5 2 10 77\n"
1.40 + "5 6 11 69\n"
1.41 + "6 5 12 41\n"
1.42 + "4 6 13 70\n"
1.43 + "3 2 14 45\n"
1.44 + "7 9 15 93\n"
1.45 + "5 9 16 50\n"
1.46 + "9 0 17 94\n"
1.47 + "9 6 18 67\n"
1.48 + "0 9 19 86\n"
1.49 "@attributes\n"
1.50 "source 3\n";
1.51
1.52 @@ -141,7 +141,7 @@
1.53 Node t = digraph.target(a);
1.54 if (dijkstra.reached(s)) {
1.55 check( dijkstra.dist(t) - dijkstra.dist(s) <= length[a],
1.56 - "Error in a shortest path tree!");
1.57 + "Error in a shortest path tree!");
1.58 }
1.59 }
1.60