1.1 --- a/test/dijkstra_test.cc	Fri Jan 05 10:59:18 2007 +0000
     1.2 +++ b/test/dijkstra_test.cc	Mon Jan 08 10:39:59 2007 +0000
     1.3 @@ -63,8 +63,7 @@
     1.4    //  pn = dijkstra_test.predNodeMap();
     1.5    b  = dijkstra_test.reached(n);
     1.6  
     1.7 -  Path<Graph> pp(G);
     1.8 -  dijkstra_test.getPath(pp,n);
     1.9 +  Path<Graph> pp = dijkstra_test.path(n);
    1.10  }
    1.11  
    1.12  void check_Dijkstra_Function_Compile() 
    1.13 @@ -120,9 +119,11 @@
    1.14    check(dijkstra_test.dist(t)==13,"Dijkstra found a wrong path.");
    1.15  
    1.16  
    1.17 -  Path<Graph> p(G);
    1.18 -  check(dijkstra_test.getPath(p,t),"getPath() failed to set the path.");
    1.19 +  Path<Graph> p = dijkstra_test.path(t);
    1.20    check(p.length()==4,"getPath() found a wrong path.");
    1.21 +  check(checkPath(G, p),"path() found a wrong path.");
    1.22 +  check(pathSource(G, p) == s,"path() found a wrong path.");
    1.23 +  check(pathTarget(G, p) == t,"path() found a wrong path.");
    1.24    
    1.25  
    1.26    for(EdgeIt e(G); e!=INVALID; ++e) {