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