1.1 --- a/lemon/bfs.h	Fri Nov 04 14:49:14 2005 +0000
     1.2 +++ b/lemon/bfs.h	Fri Nov 04 15:00:19 2005 +0000
     1.3 @@ -192,7 +192,6 @@
     1.4  
     1.5      ///Creates the maps if necessary.
     1.6      
     1.7 -    ///\todo Error if \c G are \c NULL.
     1.8      ///\todo Better memory allocation (instead of new).
     1.9      void create_maps() 
    1.10      {
    1.11 @@ -610,7 +609,6 @@
    1.12      ///This function copies the shortest path to \c t into \c p.
    1.13      ///If \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 @@ -647,7 +645,6 @@
    1.20      ///\ref predNode().
    1.21      ///\pre Either \ref run() or \ref start() must be called before using
    1.22      ///this function.
    1.23 -    ///\todo predEdge could be a better name.
    1.24      Edge predEdge(Node v) const { return (*_pred)[v];}
    1.25  
    1.26      ///Returns the 'previous node' of the shortest path tree.