1.1 --- a/dijkstrabox.cc	Fri Feb 02 10:13:33 2007 +0000
     1.2 +++ b/dijkstrabox.cc	Sat Feb 03 12:43:01 2007 +0000
     1.3 @@ -144,13 +144,11 @@
     1.4  	    {
     1.5  	      for(int j=0;j<found;j++)
     1.6  		{
     1.7 -		  Path<Graph> path(g);
     1.8 -		  sb.getPath(path, j);
     1.9 +		  Path<Graph> path;
    1.10 +		  path=sb.path(j);
    1.11  		  for(int k=0;k<path.length();k++)
    1.12  		    {
    1.13 -		      Path<Graph>::EdgeIt ei;
    1.14 -		      ei=path.nthEdge(k);
    1.15 -		      (*outputmap)[ei]=j+1;
    1.16 +		      (*outputmap)[path.nth(k)]=j+1;
    1.17  		    }
    1.18  		}
    1.19  	      o << "Result: found " << found << " paths between ";