diff -r 3915867b6975 -r 49045f2d28d4 lemon/floyd_warshall.h
--- a/lemon/floyd_warshall.h	Fri Nov 04 13:53:22 2005 +0000
+++ b/lemon/floyd_warshall.h	Fri Nov 04 14:48:10 2005 +0000
@@ -488,9 +488,9 @@
       if (connected(source, target)) {
 	p.clear();
 	typename Path::Builder b(target);
-	for(b.setStartNode(target); pred(source, target) != INVALID;
+	for(b.setStartNode(target); predEdge(source, target) != INVALID;
 	    target = predNode(target)) {
-	  b.pushFront(pred(source, target));
+	  b.pushFront(predEdge(source, target));
 	}
 	b.commit();
 	return true;
@@ -518,7 +518,7 @@
     /// shortest path tree used in \ref predNode(). 
     /// \pre \ref run() must be called before using this function.
     /// \todo predEdge could be a better name.
-    Edge pred(Node root, Node node) const { 
+    Edge predEdge(Node root, Node node) const { 
       return (*_pred)(root, node); 
     }
 
@@ -529,7 +529,7 @@
     /// one node from a shortest path from the \c root to \c node. It is 
     /// INVALID if \c node is unreachable from the root or if \c node=root. 
     /// The shortest path tree used here is equal to the 
-    /// shortest path tree used in \ref pred().  
+    /// shortest path tree used in \ref predEdge().  
     /// \pre \ref run() must be called before using this function.
     Node predNode(Node root, Node node) const { 
       return (*_pred)(root, node) == INVALID ?