1.1 --- a/lemon/dijkstra.h	Sun Feb 11 16:34:51 2007 +0000
     1.2 +++ b/lemon/dijkstra.h	Mon Feb 12 10:25:56 2007 +0000
     1.3 @@ -739,6 +739,13 @@
     1.4      ///of this funcion is undefined.
     1.5      Value dist(Node v) const { return (*_dist)[v]; }
     1.6  
     1.7 +    ///The current distance of a node from the root.
     1.8 +
     1.9 +    ///Returns the current distance of a node from the root.
    1.10 +    ///It may be decreased in the following processes.
    1.11 +    ///\pre \c node should be reached but not processed
    1.12 +    Value currentDist(Node v) const { return (*_heap)[v]; }
    1.13 +
    1.14      ///Returns the 'previous edge' of the shortest path tree.
    1.15  
    1.16      ///For a node \c v it returns the 'previous edge' of the shortest path tree,