1.1 --- a/lemon/dijkstra.h	Mon Jun 27 10:49:37 2005 +0000
     1.2 +++ b/lemon/dijkstra.h	Mon Jun 27 14:39:53 2005 +0000
     1.3 @@ -510,8 +510,10 @@
     1.4  
     1.5      ///Processes the next node in the priority heap.
     1.6      ///
     1.7 +    ///\return The processed node.
     1.8 +    ///
     1.9      ///\warning The priority heap must not be empty!
    1.10 -    void processNextNode()
    1.11 +    Node processNextNode()
    1.12      {
    1.13        Node v=_heap.top(); 
    1.14        Value oldvalue=_heap[v];
    1.15 @@ -537,6 +539,7 @@
    1.16  	  break;
    1.17  	}
    1.18        }
    1.19 +      return v;
    1.20      }
    1.21  
    1.22      ///\brief Returns \c false if there are nodes