1.1 --- a/lemon/bfs.h	Fri Nov 04 13:53:22 2005 +0000
     1.2 +++ b/lemon/bfs.h	Fri Nov 04 14:48:10 2005 +0000
     1.3 @@ -620,8 +620,8 @@
     1.4        if(reached(t)) {
     1.5  	p.clear();
     1.6  	typename P::Builder b(p);
     1.7 -	for(b.setStartNode(t);pred(t)!=INVALID;t=predNode(t))
     1.8 -	  b.pushFront(pred(t));
     1.9 +	for(b.setStartNode(t);predEdge(t)!=INVALID;t=predNode(t))
    1.10 +	  b.pushFront(predEdge(t));
    1.11  	b.commit();
    1.12  	return true;
    1.13        }
    1.14 @@ -648,7 +648,7 @@
    1.15      ///\pre Either \ref run() or \ref start() must be called before using
    1.16      ///this function.
    1.17      ///\todo predEdge could be a better name.
    1.18 -    Edge pred(Node v) const { return (*_pred)[v];}
    1.19 +    Edge predEdge(Node v) const { return (*_pred)[v];}
    1.20  
    1.21      ///Returns the 'previous node' of the shortest path tree.
    1.22  
    1.23 @@ -659,7 +659,7 @@
    1.24      ///It is INVALID if \c v is unreachable from the root(s) or
    1.25      ///if \c v itself a root.
    1.26      ///The shortest path tree used here is equal to the shortest path
    1.27 -    ///tree used in \ref pred().
    1.28 +    ///tree used in \ref predEdge().
    1.29      ///\pre Either \ref run() or \ref start() must be called before
    1.30      ///using this function.
    1.31      Node predNode(Node v) const { return (*_pred)[v]==INVALID ? INVALID: