1.1 --- a/src/lemon/dfs.h	Mon Oct 25 13:29:46 2004 +0000
     1.2 +++ b/src/lemon/dfs.h	Wed Oct 27 22:38:50 2004 +0000
     1.3 @@ -23,7 +23,7 @@
     1.4  ///
     1.5  ///\todo Revise Manual.
     1.6  
     1.7 -#include <lemon/bin_heap.h>
     1.8 +#include <lemon/graph_utils.h>
     1.9  #include <lemon/invalid.h>
    1.10  
    1.11  namespace lemon {
    1.12 @@ -193,12 +193,12 @@
    1.13  	pred_node->set(u,INVALID);
    1.14        }
    1.15        
    1.16 -      int N=G->nodeNum();
    1.17 +      int N = countNodes(*G);
    1.18        std::vector<typename Graph::OutEdgeIt> Q(N);
    1.19  
    1.20        int Qh=0;
    1.21        
    1.22 -      G->first(Q[Qh],s);
    1.23 +      Q[Qh] = OutEdgeIt(*G, s);
    1.24        distance->set(s, 0);
    1.25  
    1.26        Node n=s;
    1.27 @@ -209,7 +209,7 @@
    1.28  	  if((m=G->head(e))!=s && (*predecessor)[m=G->head(e)]==INVALID) {
    1.29  	    predecessor->set(m,e);
    1.30  	    pred_node->set(m,n);
    1.31 -	    G->first(Q[++Qh],m);
    1.32 +	    Q[++Qh] = OutEdgeIt(*G, m);
    1.33  	    distance->set(m,Qh);
    1.34  	    n=m;
    1.35  	  }