1.1 --- a/src/test/dijkstra_test.cc Wed Aug 25 18:55:57 2004 +0000
1.2 +++ b/src/test/dijkstra_test.cc Mon Aug 30 12:01:47 2004 +0000
1.3 @@ -75,7 +75,7 @@
1.4 check(dijkstra_test.dist(t)==13,"Dijkstra found a wrong path.");
1.5
1.6
1.7 - for(EdgeIt e(G); G.valid(e); G.next(e)) {
1.8 + for(EdgeIt e(G); e==INVALID; ++e) {
1.9 Node u=G.tail(e);
1.10 Node v=G.head(e);
1.11 check( !dijkstra_test.reached(u) ||
1.12 @@ -86,7 +86,7 @@
1.13 }
1.14
1.15 ///\bug This works only for integer lengths
1.16 - for(NodeIt v(G); G.valid(v); G.next(v))
1.17 + for(NodeIt v(G); v==INVALID; ++v)
1.18 if ( dijkstra_test.reached(v) ) {
1.19 Edge e=dijkstra_test.pred(v);
1.20 Node u=G.tail(e);