# HG changeset patch
# User deba
# Date 1171275956 0
# Node ID 119e406b477fb5d7954b78c66adc5c8cb4d2f724
# Parent  5365600a7a5c09a09b931cb0d98ea5d1d15e5a3c
Dijkstra could return the temporarly distance of the current node

diff -r 5365600a7a5c -r 119e406b477f lemon/dijkstra.h
--- a/lemon/dijkstra.h	Sun Feb 11 16:34:51 2007 +0000
+++ b/lemon/dijkstra.h	Mon Feb 12 10:25:56 2007 +0000
@@ -739,6 +739,13 @@
     ///of this funcion is undefined.
     Value dist(Node v) const { return (*_dist)[v]; }
 
+    ///The current distance of a node from the root.
+
+    ///Returns the current distance of a node from the root.
+    ///It may be decreased in the following processes.
+    ///\pre \c node should be reached but not processed
+    Value currentDist(Node v) const { return (*_heap)[v]; }
+
     ///Returns the 'previous edge' of the shortest path tree.
 
     ///For a node \c v it returns the 'previous edge' of the shortest path tree,