# HG changeset patch
# User jacint
# Date 1082999122 0
# Node ID ede61a3d229b10256ddbba09cbb4fb02b819ca78
# Parent  54b9430639018f64a5d1144a719dc88c2624de03
macro erase

diff -r 54b943063901 -r ede61a3d229b src/test/dijkstra_heap_test.cc
--- a/src/test/dijkstra_heap_test.cc	Mon Apr 26 16:58:14 2004 +0000
+++ b/src/test/dijkstra_heap_test.cc	Mon Apr 26 17:05:22 2004 +0000
@@ -3,8 +3,8 @@
 //Fibonacci heap of fib_heap.h.
 
 //The input is a graph in standard dimacs format from the standard input (like
-//in /hugo_loc/testfiles/dimacs). It runs dijkstra.h on this graph with
-//both heaps, checking two postconditions: 
+//in /hugo_loc/testfiles/dimacs). It runs dijkstra.h on this graph with both
+//heaps, checking two postconditions:
 
 //- if the edges e=uv of the shortest path tree reported by dijkstra.h have
 //dist(v)-dist(u)=length(e)
@@ -20,7 +20,6 @@
 #include <time_measure.h>
 #include <bin_heap.h>
 #include <fib_heap.h>
-#include <for_each_macros.h>
 
 using namespace hugo;
 
@@ -56,7 +55,7 @@
   int error1=0;
   int error2=0;
 
-  FOR_EACH_LOC ( EdgeIt, e, G) {
+  for(EdgeIt e=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] )
@@ -68,7 +67,7 @@
       }
   }
 
-  FOR_EACH_LOC ( NodeIt, v, G) {
+  for(NodeIt v=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);
@@ -104,7 +103,7 @@
   error1=0;
   error2=0;
 
-  FOR_EACH_LOC ( EdgeIt, e, G) {
+  for(EdgeIt e=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] )
@@ -116,7 +115,7 @@
       }
   }
 
-  FOR_EACH_LOC ( NodeIt, v, G) {
+  for(NodeIt v=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);