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