1.1 --- a/lemon/dijkstra.h	Fri Nov 04 14:49:14 2005 +0000
     1.2 +++ b/lemon/dijkstra.h	Fri Nov 04 15:00:19 2005 +0000
     1.3 @@ -21,7 +21,6 @@
     1.4  ///\file
     1.5  ///\brief Dijkstra algorithm.
     1.6  ///
     1.7 -///\todo getPath() should be implemented! (also for BFS and DFS)
     1.8  ///\todo dijkstraZero() solution should be revised.
     1.9  
    1.10  #include <lemon/list_graph.h>
    1.11 @@ -246,7 +245,6 @@
    1.12  
    1.13      ///Creates the maps if necessary.
    1.14      
    1.15 -    ///\todo Error if \c G or are \c NULL. What about \c length?
    1.16      ///\todo Better memory allocation (instead of new).
    1.17      void create_maps() 
    1.18      {
    1.19 @@ -723,7 +721,6 @@
    1.20      ///This function copies the shortest path to \c t into \c p.
    1.21      ///If it \c t is a source itself or unreachable, then it does not
    1.22      ///alter \c p.
    1.23 -    ///\todo Is it the right way to handle unreachable nodes?
    1.24      ///\return Returns \c true if a path to \c t was actually copied to \c p,
    1.25      ///\c false otherwise.
    1.26      ///\sa DirPath
    1.27 @@ -758,7 +755,6 @@
    1.28      ///shortest path tree used here is equal to the shortest path tree used in
    1.29      ///\ref predNode().  \pre \ref run() must be called before using
    1.30      ///this function.
    1.31 -    ///\todo predEdge could be a better name.
    1.32      Edge predEdge(Node v) const { return (*_pred)[v]; }
    1.33  
    1.34      ///Returns the 'previous node' of the shortest path tree.