diff -r 7dac7356c023 -r f15b3c09481c lemon/belmann_ford.h
--- a/lemon/belmann_ford.h	Fri Nov 04 14:49:14 2005 +0000
+++ b/lemon/belmann_ford.h	Fri Nov 04 15:00:19 2005 +0000
@@ -21,7 +21,6 @@
 /// \file
 /// \brief BelmannFord algorithm.
 ///
-/// \todo getPath() should be implemented! (also for BFS and DFS)
 
 #include <lemon/list_graph.h>
 #include <lemon/invalid.h>
@@ -494,7 +493,7 @@
     /// 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
@@ -528,7 +527,6 @@
     /// 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 v) const { return (*_pred)[v]; }
 
     /// \brief Returns the 'previous node' of the shortest path tree.