diff -r 3915867b6975 -r 49045f2d28d4 test/heap_test.h
--- a/test/heap_test.h	Fri Nov 04 13:53:22 2005 +0000
+++ b/test/heap_test.h	Fri Nov 04 14:48:10 2005 +0000
@@ -93,8 +93,8 @@
   }
 
   for(NodeIt v(graph); v!=INVALID; ++v) {
-    if ( dijkstra.reached(v) && dijkstra.pred(v) != INVALID ) {
-      Edge e=dijkstra.pred(v);
+    if ( dijkstra.reached(v) && dijkstra.predEdge(v) != INVALID ) {
+      Edge e=dijkstra.predEdge(v);
       Node u=graph.source(e);
       check( dijkstra.dist(v) - dijkstra .dist(u) == length[e],
 	     "Error in a shortest path tree edge!");