diff -r f2ea4aac9ada -r c94ef40a22ce src/lemon/dfs.h
--- a/src/lemon/dfs.h	Mon Oct 25 13:29:46 2004 +0000
+++ b/src/lemon/dfs.h	Wed Oct 27 22:38:50 2004 +0000
@@ -23,7 +23,7 @@
 ///
 ///\todo Revise Manual.
 
-#include <lemon/bin_heap.h>
+#include <lemon/graph_utils.h>
 #include <lemon/invalid.h>
 
 namespace lemon {
@@ -193,12 +193,12 @@
 	pred_node->set(u,INVALID);
       }
       
-      int N=G->nodeNum();
+      int N = countNodes(*G);
       std::vector<typename Graph::OutEdgeIt> Q(N);
 
       int Qh=0;
       
-      G->first(Q[Qh],s);
+      Q[Qh] = OutEdgeIt(*G, s);
       distance->set(s, 0);
 
       Node n=s;
@@ -209,7 +209,7 @@
 	  if((m=G->head(e))!=s && (*predecessor)[m=G->head(e)]==INVALID) {
 	    predecessor->set(m,e);
 	    pred_node->set(m,n);
-	    G->first(Q[++Qh],m);
+	    Q[++Qh] = OutEdgeIt(*G, m);
 	    distance->set(m,Qh);
 	    n=m;
 	  }