diff -r 3915867b6975 -r 49045f2d28d4 lemon/dijkstra.h
--- a/lemon/dijkstra.h	Fri Nov 04 13:53:22 2005 +0000
+++ b/lemon/dijkstra.h	Fri Nov 04 14:48:10 2005 +0000
@@ -733,8 +733,8 @@
       if(reached(t)) {
 	p.clear();
 	typename P::Builder b(p);
-	for(b.setStartNode(t);pred(t)!=INVALID;t=predNode(t))
-	  b.pushFront(pred(t));
+	for(b.setStartNode(t);predEdge(t)!=INVALID;t=predNode(t))
+	  b.pushFront(predEdge(t));
 	b.commit();
 	return true;
       }
@@ -759,7 +759,7 @@
     ///\ref predNode().  \pre \ref run() must be called before using
     ///this function.
     ///\todo predEdge could be a better name.
-    Edge pred(Node v) const { return (*_pred)[v]; }
+    Edge predEdge(Node v) const { return (*_pred)[v]; }
 
     ///Returns the 'previous node' of the shortest path tree.
 
@@ -767,7 +767,7 @@
     ///i.e. it returns the last but one node from a shortest path from the
     ///root to \c /v. It is INVALID if \c v is unreachable from the root or if
     ///\c v=s. The shortest path tree used here is equal to the shortest path
-    ///tree used in \ref pred().  \pre \ref run() must be called before
+    ///tree used in \ref predEdge().  \pre \ref run() must be called before
     ///using this function.
     Node predNode(Node v) const { return (*_pred)[v]==INVALID ? INVALID:
 				  G->source((*_pred)[v]); }