1.1 --- a/lemon/floyd_warshall.h	Fri Nov 04 14:49:14 2005 +0000
     1.2 +++ b/lemon/floyd_warshall.h	Fri Nov 04 15:00:19 2005 +0000
     1.3 @@ -21,7 +21,6 @@
     1.4  /// \file
     1.5  /// \brief FloydWarshall 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/graph_utils.h>
    1.11 @@ -479,7 +478,6 @@
    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      /// \return Returns \c true if a path to \c t was actually copied to \c p,
    1.17      /// \c false otherwise.
    1.18      /// \sa DirPath
    1.19 @@ -517,7 +515,6 @@
    1.20      /// or if \c node=root. The shortest path tree used here is equal to the 
    1.21      /// shortest path tree used in \ref predNode(). 
    1.22      /// \pre \ref run() must be called before using this function.
    1.23 -    /// \todo predEdge could be a better name.
    1.24      Edge predEdge(Node root, Node node) const { 
    1.25        return (*_pred)(root, node); 
    1.26      }