1.1 --- a/test/bfs_test.cc Fri Nov 04 13:53:22 2005 +0000
1.2 +++ b/test/bfs_test.cc Fri Nov 04 14:48:10 2005 +0000
1.3 @@ -50,7 +50,7 @@
1.4 bfs_test.run(n);
1.5
1.6 l = bfs_test.dist(n);
1.7 - e = bfs_test.pred(n);
1.8 + e = bfs_test.predEdge(n);
1.9 n = bfs_test.predNode(n);
1.10 d = bfs_test.distMap();
1.11 p = bfs_test.predMap();
1.12 @@ -121,8 +121,8 @@
1.13
1.14 for(NodeIt v(G); v==INVALID; ++v) {
1.15 check(bfs_test.reached(v),"Each node should be reached.");
1.16 - if ( bfs_test.pred(v)!=INVALID ) {
1.17 - Edge e=bfs_test.pred(v);
1.18 + if ( bfs_test.predEdge(v)!=INVALID ) {
1.19 + Edge e=bfs_test.predEdge(v);
1.20 Node u=G.source(e);
1.21 check(u==bfs_test.predNode(v),"Wrong tree.");
1.22 check(bfs_test.dist(v) - bfs_test.dist(u) == 1,