1.1 --- a/lemon/dijkstra.h	Tue Aug 30 13:48:40 2005 +0000
     1.2 +++ b/lemon/dijkstra.h	Tue Aug 30 14:55:11 2005 +0000
     1.3 @@ -546,6 +546,17 @@
     1.4        return v;
     1.5      }
     1.6  
     1.7 +    ///Next node to be processed.
     1.8 +    
     1.9 +    ///Next node to be processed.
    1.10 +    ///
    1.11 +    ///\return The next node to be processed or INVALID if the priority heap
    1.12 +    /// is empty.
    1.13 +    Node NextNode()
    1.14 +    { 
    1.15 +      return _heap.empty()?_heap.top():INVALID;
    1.16 +    }
    1.17 + 
    1.18      ///\brief Returns \c false if there are nodes
    1.19      ///to be processed in the priority heap
    1.20      ///