diff -r f67737f5727a -r e15162d8eca1 lemon/dijkstra.h
--- a/lemon/dijkstra.h	Tue Aug 16 16:44:57 2005 +0000
+++ b/lemon/dijkstra.h	Tue Aug 16 19:06:59 2005 +0000
@@ -702,7 +702,7 @@
     ///v. It is \ref 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 predNode(Node v).  \pre \ref run() must be called before using
+    ///\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]; }
@@ -713,7 +713,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(Node v).  \pre \ref run() must be called before
+    ///tree used in \ref pred().  \pre \ref run() must be called before
     ///using this function.
     Node predNode(Node v) const { return (*_pred)[v]==INVALID ? INVALID:
 				  G->source((*_pred)[v]); }