1.1 --- a/test/dijkstra_test.cc	Sun Jul 13 19:51:02 2008 +0100
     1.2 +++ b/test/dijkstra_test.cc	Sun Jul 13 20:09:47 2008 +0100
     1.3 @@ -110,8 +110,10 @@
     1.4    for(ArcIt e(G); e!=INVALID; ++e) {
     1.5      Node u=G.source(e);
     1.6      Node v=G.target(e);
     1.7 -    check( !dijkstra_test.reached(u) || (dijkstra_test.dist(v) - dijkstra_test.dist(u) <= length[e]),
     1.8 -           "dist(target)-dist(source)-arc_length= " << dijkstra_test.dist(v) - dijkstra_test.dist(u) - length[e]);
     1.9 +    check( !dijkstra_test.reached(u) ||
    1.10 +           (dijkstra_test.dist(v) - dijkstra_test.dist(u) <= length[e]),
    1.11 +           "dist(target)-dist(source)-arc_length= " <<
    1.12 +           dijkstra_test.dist(v) - dijkstra_test.dist(u) - length[e]);
    1.13    }
    1.14  
    1.15    for(NodeIt v(G); v!=INVALID; ++v){
    1.16 @@ -121,7 +123,8 @@
    1.17        Node u=G.source(e);
    1.18        check(u==dijkstra_test.predNode(v),"Wrong tree.");
    1.19        check(dijkstra_test.dist(v) - dijkstra_test.dist(u) == length[e],
    1.20 -            "Wrong distance! Difference: " << std::abs(dijkstra_test.dist(v) - dijkstra_test.dist(u) - length[e]));
    1.21 +            "Wrong distance! Difference: " <<
    1.22 +            std::abs(dijkstra_test.dist(v)-dijkstra_test.dist(u)-length[e]));
    1.23      }
    1.24    }
    1.25