diff -r 7dac7356c023 -r f15b3c09481c lemon/dfs.h
--- a/lemon/dfs.h	Fri Nov 04 14:49:14 2005 +0000
+++ b/lemon/dfs.h	Fri Nov 04 15:00:19 2005 +0000
@@ -192,7 +192,6 @@
 
     ///Creates the maps if necessary.
     
-    ///\todo Error if \c G are \c NULL.
     ///\todo Better memory allocation (instead of new).
     void create_maps() 
     {
@@ -508,14 +507,10 @@
     ///
     ///Returns \c false if there are nodes
     ///to be processed in the queue
-    ///
-    ///\todo This should be called emptyStack() or some "neutral" name.
     bool emptyQueue() { return _stack_head<0; }
     ///Returns the number of the nodes to be processed.
     
     ///Returns the number of the nodes to be processed in the queue.
-    ///
-    ///\todo This should be called stackSize() or some "neutral" name.
     int queueSize() { return _stack_head+1; }
     
     ///Executes the algorithm.
@@ -631,7 +626,6 @@
     ///This function copies the path to \c t on the DFS tree  into \c p.
     ///If \c t is a source itself or unreachable, then it does not
     ///alter \c p.
-    ///\todo Is this the right way to handle unreachable nodes?
     ///
     ///\return Returns \c true if a path to \c t was actually copied to \c p,
     ///\c false otherwise.
@@ -669,7 +663,6 @@
     ///\ref predNode().
     ///\pre Either \ref run() or \ref start() must be called before using
     ///this function.
-    ///\todo predEdge could be a better name.
     Edge predEdge(Node v) const { return (*_pred)[v];}
 
     ///Returns the 'previous node' of the %DFS tree.
@@ -1381,15 +1374,11 @@
     ///
     /// Returns \c false if there are nodes
     /// to be processed in the queue
-    ///
-    /// \todo This should be called emptyStack() or some "neutral" name.
     bool emptyQueue() { return _stack_head < 0; }
 
     /// \brief Returns the number of the nodes to be processed.
     ///
     /// Returns the number of the nodes to be processed in the queue.
-    ///
-    ///\todo This should be called stackSize() or some "neutral" name.
     int queueSize() { return _stack_head + 1; }
     
     /// \brief Executes the algorithm.