# HG changeset patch
# User jacint
# Date 1083090819 0
# Node ID c30569f5493660a0a009c2872ce9d7c1e050321d
# Parent  510c53fd06cdf862e5d645683a118dc9eaf74956
debug

diff -r 510c53fd06cd -r c30569f54936 src/test/dijkstra_heap_test.cc
--- a/src/test/dijkstra_heap_test.cc	Tue Apr 27 16:27:08 2004 +0000
+++ b/src/test/dijkstra_heap_test.cc	Tue Apr 27 18:33:39 2004 +0000
@@ -55,7 +55,8 @@
   int error1=0;
   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);
     if ( dijkstra_test.dist(v) - dijkstra_test.dist(u) > cap[e] )
@@ -67,7 +68,8 @@
       }
   }
 
-  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);
       Node u=G.tail(e);
@@ -88,7 +90,7 @@
 
 
   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 " << 
     G.nodeNum() << " nodes and " << G.edgeNum() << " edges..."
@@ -103,7 +105,7 @@
   error1=0;
   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);
     if ( dijkstra_test2.dist(v) - dijkstra_test2.dist(u) > cap[e] )
@@ -115,7 +117,7 @@
       }
   }
 
-  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);
       Node u=G.tail(e);