lemon/dijkstra.h
changeset 2375 e30a0fdad0d7
parent 2354 3609c77b77be
child 2376 0ed45a6c74b1
equal deleted inserted replaced
27:a6327a808bc0 28:471e736eec6c
   737     ///\pre \ref run() must be called before using this function.
   737     ///\pre \ref run() must be called before using this function.
   738     ///\warning If node \c v in unreachable from the root the return value
   738     ///\warning If node \c v in unreachable from the root the return value
   739     ///of this funcion is undefined.
   739     ///of this funcion is undefined.
   740     Value dist(Node v) const { return (*_dist)[v]; }
   740     Value dist(Node v) const { return (*_dist)[v]; }
   741 
   741 
       
   742     ///The current distance of a node from the root.
       
   743 
       
   744     ///Returns the current distance of a node from the root.
       
   745     ///It may be decreased in the following processes.
       
   746     ///\pre \c node should be reached but not processed
       
   747     Value currentDist(Node v) const { return (*_heap)[v]; }
       
   748 
   742     ///Returns the 'previous edge' of the shortest path tree.
   749     ///Returns the 'previous edge' of the shortest path tree.
   743 
   750 
   744     ///For a node \c v it returns the 'previous edge' of the shortest path tree,
   751     ///For a node \c v it returns the 'previous edge' of the shortest path tree,
   745     ///i.e. it returns the last edge of a shortest path from the root to \c
   752     ///i.e. it returns the last edge of a shortest path from the root to \c
   746     ///v. It is \ref INVALID
   753     ///v. It is \ref INVALID