1.1 --- a/lemon/belmann_ford.h	Fri Nov 04 14:49:14 2005 +0000
     1.2 +++ b/lemon/belmann_ford.h	Fri Nov 04 15:00:19 2005 +0000
     1.3 @@ -21,7 +21,6 @@
     1.4  /// \file
     1.5  /// \brief BelmannFord algorithm.
     1.6  ///
     1.7 -/// \todo getPath() should be implemented! (also for BFS and DFS)
     1.8  
     1.9  #include <lemon/list_graph.h>
    1.10  #include <lemon/invalid.h>
    1.11 @@ -494,7 +493,7 @@
    1.12      /// This function copies the shortest path to \c t into \c p.
    1.13      /// If it \c t is a source itself or unreachable, then it does not
    1.14      /// alter \c p.
    1.15 -    /// \todo Is it the right way to handle unreachable nodes?
    1.16 +    ///
    1.17      /// \return Returns \c true if a path to \c t was actually copied to \c p,
    1.18      /// \c false otherwise.
    1.19      /// \sa DirPath
    1.20 @@ -528,7 +527,6 @@
    1.21      /// path tree used in \ref predNode(). 
    1.22      /// \pre \ref run() must be called before using
    1.23      /// this function.
    1.24 -    /// \todo predEdge could be a better name.
    1.25      Edge predEdge(Node v) const { return (*_pred)[v]; }
    1.26  
    1.27      /// \brief Returns the 'previous node' of the shortest path tree.