1.1 --- a/src/lemon/bfs.h	Sat Nov 13 12:24:01 2004 +0000
     1.2 +++ b/src/lemon/bfs.h	Sat Nov 13 12:53:28 2004 +0000
     1.3 @@ -209,7 +209,7 @@
     1.4  	int d= (*distance)[n]+1;
     1.5  	
     1.6  	for(OutEdgeIt e(*G,n);e!=INVALID;++e)
     1.7 -	  if((m=G->head(e))!=s && (*predecessor)[m]==INVALID) {
     1.8 +	  if((m=G->target(e))!=s && (*predecessor)[m]==INVALID) {
     1.9  	    Q[Qh++]=m;
    1.10  	    predecessor->set(m,e);
    1.11  	    pred_node->set(m,n);