Changeset 1765:f15b3c09481c in lemon-0.x for lemon/dfs.h

Timestamp:

11/04/05 16:00:19 (18 years ago)

Author:

Balazs Dezso

Branch:

default

Phase:

public

Convert:

svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2297

Message:

Removing todos

File:

• lemon/dfs.h (modified) (6 diffs)

lemon/dfs.h

@@ -193 +193 @@
     ///Creates the maps if necessary.
     
-    ///\todo Error if \c G are \c NULL.
     ///\todo Better memory allocation (instead of new).
     void create_maps() 
@@ -509 +508 @@
     ///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; }
     
@@ -632 +627 @@
     ///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,
@@ -670 +664 @@
     ///\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];}
 
@@ -1382 +1375 @@
     /// 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; }
 
@@ -1389 +1380 @@
     ///
     /// 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; }