1.1 --- a/lemon/dfs.h	Tue Aug 30 13:48:40 2005 +0000
     1.2 +++ b/lemon/dfs.h	Tue Aug 30 14:55:11 2005 +0000
     1.3 @@ -552,17 +552,30 @@
     1.4        }
     1.5        return e;
     1.6      }
     1.7 +    ///Next edge to be processed.
     1.8 +
     1.9 +    ///Next edge to be processed.
    1.10 +    ///
    1.11 +    ///\return The next edge to be processed or INVALID if the stack is
    1.12 +    /// empty.
    1.13 +    OutEdgeIt NextEdge()
    1.14 +    { 
    1.15 +      return _stack_head>=0?_stack[_stack_head]:INVALID;
    1.16 +    }
    1.17        
    1.18      ///\brief Returns \c false if there are nodes
    1.19      ///to be processed in the queue
    1.20      ///
    1.21      ///Returns \c false if there are nodes
    1.22      ///to be processed in the queue
    1.23 +    ///
    1.24 +    ///\todo This should be called emptyStack() or some "neutral" name.
    1.25      bool emptyQueue() { return _stack_head<0; }
    1.26      ///Returns the number of the nodes to be processed.
    1.27      
    1.28      ///Returns the number of the nodes to be processed in the queue.
    1.29      ///
    1.30 +    ///\todo This should be called stackSize() or some "neutral" name.
    1.31      int queueSize() { return _stack_head+1; }
    1.32      
    1.33      ///Executes the algorithm.