1.1 --- a/lemon/johnson.h	Fri Nov 04 14:49:14 2005 +0000
     1.2 +++ b/lemon/johnson.h	Fri Nov 04 15:00:19 2005 +0000
     1.3 @@ -625,7 +625,6 @@
     1.4      /// This function copies the shortest path to \c t into \c p.
     1.5      /// If it \c t is a source itself or unreachable, then it does not
     1.6      /// alter \c p.
     1.7 -    /// \todo Is it the right way to handle unreachable nodes?
     1.8      /// \return Returns \c true if a path to \c t was actually copied to \c p,
     1.9      /// \c false otherwise.
    1.10      /// \sa DirPath
    1.11 @@ -663,7 +662,6 @@
    1.12      /// or if \c node=root. The shortest path tree used here is equal to the 
    1.13      /// shortest path tree used in \ref predNode(). 
    1.14      /// \pre \ref run() must be called before using this function.
    1.15 -    /// \todo predEdge could be a better name.
    1.16      Edge predEdge(Node root, Node node) const { 
    1.17        return (*_pred)(root, node); 
    1.18      }