1.1 --- a/lemon/dfs.h	Fri Nov 04 14:49:14 2005 +0000
     1.2 +++ b/lemon/dfs.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 @@ -508,14 +507,10 @@
    1.12      ///
    1.13      ///Returns \c false if there are nodes
    1.14      ///to be processed in the queue
    1.15 -    ///
    1.16 -    ///\todo This should be called emptyStack() or some "neutral" name.
    1.17      bool emptyQueue() { return _stack_head<0; }
    1.18      ///Returns the number of the nodes to be processed.
    1.19      
    1.20      ///Returns the number of the nodes to be processed in the queue.
    1.21 -    ///
    1.22 -    ///\todo This should be called stackSize() or some "neutral" name.
    1.23      int queueSize() { return _stack_head+1; }
    1.24      
    1.25      ///Executes the algorithm.
    1.26 @@ -631,7 +626,6 @@
    1.27      ///This function copies the path to \c t on the DFS tree  into \c p.
    1.28      ///If \c t is a source itself or unreachable, then it does not
    1.29      ///alter \c p.
    1.30 -    ///\todo Is this the right way to handle unreachable nodes?
    1.31      ///
    1.32      ///\return Returns \c true if a path to \c t was actually copied to \c p,
    1.33      ///\c false otherwise.
    1.34 @@ -669,7 +663,6 @@
    1.35      ///\ref predNode().
    1.36      ///\pre Either \ref run() or \ref start() must be called before using
    1.37      ///this function.
    1.38 -    ///\todo predEdge could be a better name.
    1.39      Edge predEdge(Node v) const { return (*_pred)[v];}
    1.40  
    1.41      ///Returns the 'previous node' of the %DFS tree.
    1.42 @@ -1381,15 +1374,11 @@
    1.43      ///
    1.44      /// Returns \c false if there are nodes
    1.45      /// to be processed in the queue
    1.46 -    ///
    1.47 -    /// \todo This should be called emptyStack() or some "neutral" name.
    1.48      bool emptyQueue() { return _stack_head < 0; }
    1.49  
    1.50      /// \brief Returns the number of the nodes to be processed.
    1.51      ///
    1.52      /// Returns the number of the nodes to be processed in the queue.
    1.53 -    ///
    1.54 -    ///\todo This should be called stackSize() or some "neutral" name.
    1.55      int queueSize() { return _stack_head + 1; }
    1.56      
    1.57      /// \brief Executes the algorithm.