1.1 --- a/test/heap_test.h	Fri Nov 04 13:53:22 2005 +0000
     1.2 +++ b/test/heap_test.h	Fri Nov 04 14:48:10 2005 +0000
     1.3 @@ -93,8 +93,8 @@
     1.4    }
     1.5  
     1.6    for(NodeIt v(graph); v!=INVALID; ++v) {
     1.7 -    if ( dijkstra.reached(v) && dijkstra.pred(v) != INVALID ) {
     1.8 -      Edge e=dijkstra.pred(v);
     1.9 +    if ( dijkstra.reached(v) && dijkstra.predEdge(v) != INVALID ) {
    1.10 +      Edge e=dijkstra.predEdge(v);
    1.11        Node u=graph.source(e);
    1.12        check( dijkstra.dist(v) - dijkstra .dist(u) == length[e],
    1.13  	     "Error in a shortest path tree edge!");