diff -r 7dac7356c023 -r f15b3c09481c lemon/johnson.h
--- a/lemon/johnson.h	Fri Nov 04 14:49:14 2005 +0000
+++ b/lemon/johnson.h	Fri Nov 04 15:00:19 2005 +0000
@@ -625,7 +625,6 @@
     /// This function copies the shortest path to \c t into \c p.
     /// If it \c t is a source itself or unreachable, then it does not
     /// alter \c p.
-    /// \todo Is it the right way to handle unreachable nodes?
     /// \return Returns \c true if a path to \c t was actually copied to \c p,
     /// \c false otherwise.
     /// \sa DirPath
@@ -663,7 +662,6 @@
     /// or if \c node=root. The shortest path tree used here is equal to the 
     /// 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 predEdge(Node root, Node node) const { 
       return (*_pred)(root, node); 
     }