1.1 --- a/lemon/dfs.h	Mon Jun 27 10:49:37 2005 +0000
     1.2 +++ b/lemon/dfs.h	Mon Jun 27 14:39:53 2005 +0000
     1.3 @@ -516,8 +516,10 @@
     1.4  
     1.5      ///Processes the next node.
     1.6      ///
     1.7 +    ///\return The processed edge.
     1.8 +    ///
     1.9      ///\pre The stack must not be empty!
    1.10 -    void processNextEdge()
    1.11 +    Edge processNextEdge()
    1.12      { 
    1.13        Node m;
    1.14        Edge e=_stack[_stack_head];
    1.15 @@ -539,6 +541,7 @@
    1.16  	    --_stack_head;
    1.17  	  }
    1.18        }
    1.19 +      return e;
    1.20      }
    1.21        
    1.22      ///\brief Returns \c false if there are nodes