1.1 --- a/src/test/dijkstra_test.cc	Sat Nov 13 12:24:01 2004 +0000
     1.2 +++ b/src/test/dijkstra_test.cc	Sat Nov 13 12:53:28 2004 +0000
     1.3 @@ -93,11 +93,11 @@
     1.4  
     1.5  
     1.6    for(EdgeIt e(G); e!=INVALID; ++e) {
     1.7 -    Node u=G.tail(e);
     1.8 -    Node v=G.head(e);
     1.9 +    Node u=G.source(e);
    1.10 +    Node v=G.target(e);
    1.11      check( !dijkstra_test.reached(u) ||
    1.12  	   (dijkstra_test.dist(v) - dijkstra_test.dist(u) <= cap[e]),
    1.13 -	   "dist(head)-dist(tail)- edge_length= " 
    1.14 +	   "dist(target)-dist(source)- edge_length= " 
    1.15  	   << dijkstra_test.dist(v) - dijkstra_test.dist(u) 
    1.16  	   - cap[e]);
    1.17    }
    1.18 @@ -107,7 +107,7 @@
    1.19      check(dijkstra_test.reached(v),"Each node should be reached.");
    1.20      if ( dijkstra_test.pred(v)!=INVALID ) {
    1.21        Edge e=dijkstra_test.pred(v);
    1.22 -      Node u=G.tail(e);
    1.23 +      Node u=G.source(e);
    1.24        check(u==dijkstra_test.predNode(v),"Wrong tree.");
    1.25        check(dijkstra_test.dist(v) - dijkstra_test.dist(u) == cap[e],
    1.26  	    "Wrong distance! Difference: "