Changeset 422:ede61a3d229b in lemon0.x for src/test/dijkstra_heap_test.cc
 Timestamp:
 04/26/04 19:05:22 (20 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@562
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

src/test/dijkstra_heap_test.cc
r386 r422 4 4 5 5 //The input is a graph in standard dimacs format from the standard input (like 6 //in /hugo_loc/testfiles/dimacs). It runs dijkstra.h on this graph with 7 // both heaps, checking two postconditions:6 //in /hugo_loc/testfiles/dimacs). It runs dijkstra.h on this graph with both 7 //heaps, checking two postconditions: 8 8 9 9 // if the edges e=uv of the shortest path tree reported by dijkstra.h have … … 21 21 #include <bin_heap.h> 22 22 #include <fib_heap.h> 23 #include <for_each_macros.h>24 23 25 24 using namespace hugo; … … 57 56 int error2=0; 58 57 59 FOR_EACH_LOC ( EdgeIt, e, G) {58 for(EdgeIt e=G.first(e); G.valid(e); G.next(e)) { 60 59 Node u=G.tail(e); 61 60 Node v=G.head(e); … … 69 68 } 70 69 71 FOR_EACH_LOC ( NodeIt, v, G) {70 for(NodeIt v=G.first(v); G.valid(v); G.next(v)) { 72 71 if ( dijkstra_test.reached(v) ) { 73 72 Edge e=dijkstra_test.pred(v); … … 105 104 error2=0; 106 105 107 FOR_EACH_LOC ( EdgeIt, e, G) {106 for(EdgeIt e=G.first(e); G.valid(e); G.next(e)) { 108 107 Node u=G.tail(e); 109 108 Node v=G.head(e); … … 117 116 } 118 117 119 FOR_EACH_LOC ( NodeIt, v, G) {118 for(NodeIt v=G.first(v); G.valid(v); G.next(v)) { 120 119 if ( dijkstra_test2.reached(v) ) { 121 120 Edge e=dijkstra_test2.pred(v);
Note: See TracChangeset
for help on using the changeset viewer.