Changeset 449:c30569f54936 in lemon0.x for src/test/dijkstra_heap_test.cc
 Timestamp:
 04/27/04 20:33:39 (18 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@597
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

src/test/dijkstra_heap_test.cc
r422 r449 56 56 int error2=0; 57 57 58 for(EdgeIt e=G.first(e); G.valid(e); G.next(e)) { 58 EdgeIt e; 59 for(G.first(e); G.valid(e); G.next(e)) { 59 60 Node u=G.tail(e); 60 61 Node v=G.head(e); … … 68 69 } 69 70 70 for(NodeIt v=G.first(v); G.valid(v); G.next(v)) { 71 NodeIt v; 72 for(G.first(v); G.valid(v); G.next(v)) { 71 73 if ( dijkstra_test.reached(v) ) { 72 74 Edge e=dijkstra_test.pred(v); … … 89 91 90 92 std::cout << 91 "\n Testing dijkstra.h with Fibonacci heap implementation fib_heap.h,"93 "\n\n Testing dijkstra.h with Fibonacci heap implementation fib_heap.h," 92 94 <<std::endl; 93 95 std::cout<<" on a graph with " << … … 104 106 error2=0; 105 107 106 for( EdgeIt e=G.first(e); G.valid(e); G.next(e)) {108 for(G.first(e); G.valid(e); G.next(e)) { 107 109 Node u=G.tail(e); 108 110 Node v=G.head(e); … … 116 118 } 117 119 118 for( NodeIt v=G.first(v); G.valid(v); G.next(v)) {120 for(G.first(v); G.valid(v); G.next(v)) { 119 121 if ( dijkstra_test2.reached(v) ) { 120 122 Edge e=dijkstra_test2.pred(v);
Note: See TracChangeset
for help on using the changeset viewer.