1.1 --- a/lemon/dijkstra.h	Tue Aug 16 16:44:57 2005 +0000
     1.2 +++ b/lemon/dijkstra.h	Tue Aug 16 19:06:59 2005 +0000
     1.3 @@ -702,7 +702,7 @@
     1.4      ///v. It is \ref INVALID
     1.5      ///if \c v is unreachable from the root or if \c v=s. The
     1.6      ///shortest path tree used here is equal to the shortest path tree used in
     1.7 -    ///\ref predNode(Node v).  \pre \ref run() must be called before using
     1.8 +    ///\ref predNode().  \pre \ref run() must be called before using
     1.9      ///this function.
    1.10      ///\todo predEdge could be a better name.
    1.11      Edge pred(Node v) const { return (*_pred)[v]; }
    1.12 @@ -713,7 +713,7 @@
    1.13      ///i.e. it returns the last but one node from a shortest path from the
    1.14      ///root to \c /v. It is INVALID if \c v is unreachable from the root or if
    1.15      ///\c v=s. The shortest path tree used here is equal to the shortest path
    1.16 -    ///tree used in \ref pred(Node v).  \pre \ref run() must be called before
    1.17 +    ///tree used in \ref pred().  \pre \ref run() must be called before
    1.18      ///using this function.
    1.19      Node predNode(Node v) const { return (*_pred)[v]==INVALID ? INVALID:
    1.20  				  G->source((*_pred)[v]); }