# HG changeset patch
# User alpar
# Date 1119883193 0
# Node ID 4aeda8d11d5e625428583657c025b8370ad247df
# Parent  dd7616b513338f4a2bb0282c256f395eed2f45fb
processNextXyz() returns the processed object.

diff -r dd7616b51333 -r 4aeda8d11d5e lemon/bfs.h
--- a/lemon/bfs.h	Mon Jun 27 10:49:37 2005 +0000
+++ b/lemon/bfs.h	Mon Jun 27 14:39:53 2005 +0000
@@ -517,8 +517,10 @@
 
     ///Processes the next node.
     ///
+    ///\return The processed node.
+    ///
     ///\warning The queue must not be empty!
-    void processNextNode()
+    Node processNextNode()
     {
       if(_queue_tail==_queue_next_dist) {
 	_curr_dist++;
@@ -535,6 +537,7 @@
 // 	  _pred_node->set(m,n);
 	  _dist->set(m,_curr_dist);
 	}
+      return n;
     }
       
     ///\brief Returns \c false if there are nodes
diff -r dd7616b51333 -r 4aeda8d11d5e lemon/dfs.h
--- a/lemon/dfs.h	Mon Jun 27 10:49:37 2005 +0000
+++ b/lemon/dfs.h	Mon Jun 27 14:39:53 2005 +0000
@@ -516,8 +516,10 @@
 
     ///Processes the next node.
     ///
+    ///\return The processed edge.
+    ///
     ///\pre The stack must not be empty!
-    void processNextEdge()
+    Edge processNextEdge()
     { 
       Node m;
       Edge e=_stack[_stack_head];
@@ -539,6 +541,7 @@
 	    --_stack_head;
 	  }
       }
+      return e;
     }
       
     ///\brief Returns \c false if there are nodes
diff -r dd7616b51333 -r 4aeda8d11d5e lemon/dijkstra.h
--- a/lemon/dijkstra.h	Mon Jun 27 10:49:37 2005 +0000
+++ b/lemon/dijkstra.h	Mon Jun 27 14:39:53 2005 +0000
@@ -510,8 +510,10 @@
 
     ///Processes the next node in the priority heap.
     ///
+    ///\return The processed node.
+    ///
     ///\warning The priority heap must not be empty!
-    void processNextNode()
+    Node processNextNode()
     {
       Node v=_heap.top(); 
       Value oldvalue=_heap[v];
@@ -537,6 +539,7 @@
 	  break;
 	}
       }
+      return v;
     }
 
     ///\brief Returns \c false if there are nodes