Changeset 449:c30569f54936 in lemon-0.x for src/test

Timestamp:

04/27/04 20:33:39 (21 years ago)

Author:

jacint

Branch:

default

Phase:

public

Convert:

svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@597

Message:

debug

File:

• src/test/dijkstra_heap_test.cc (modified) (5 diffs)

src/test/dijkstra_heap_test.cc

@@ -56 +56 @@
   int error2=0;
 
-  for(EdgeIt e=G.first(e); G.valid(e); G.next(e)) {
+  EdgeIt e;
+  for(G.first(e); G.valid(e); G.next(e)) {
     Node u=G.tail(e);
     Node v=G.head(e);
@@ -68 +69 @@
   }
 
-  for(NodeIt v=G.first(v); G.valid(v); G.next(v)) {
+  NodeIt v;
+  for(G.first(v); G.valid(v); G.next(v)) {
     if ( dijkstra_test.reached(v) ) {
       Edge e=dijkstra_test.pred(v);
@@ -89 +91 @@
 
   std::cout <<
-    "\n  Testing dijkstra.h with Fibonacci heap implementation fib_heap.h,"
+    "\n\n  Testing dijkstra.h with Fibonacci heap implementation fib_heap.h,"
             <<std::endl;
   std::cout<<"  on a graph with " << 
@@ -104 +106 @@
   error2=0;
 
-  for(EdgeIt e=G.first(e); G.valid(e); G.next(e)) {
+  for(G.first(e); G.valid(e); G.next(e)) {
     Node u=G.tail(e);
     Node v=G.head(e);
@@ -116 +118 @@
   }
 
-  for(NodeIt v=G.first(v); G.valid(v); G.next(v)) {
+  for(G.first(v); G.valid(v); G.next(v)) {
     if ( dijkstra_test2.reached(v) ) {
       Edge e=dijkstra_test2.pred(v);