Changeset 987:87f7c54892df in lemon0.x for src/work/deba/dijkstra.h
 Timestamp:
 11/13/04 18:07:10 (17 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@1377
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

src/work/deba/dijkstra.h
r921 r987 22 22 ///so it is easy to change it to any kind of length. 23 23 /// 24 ///The type of the length is determined by the \c Value Typeof the length map.24 ///The type of the length is determined by the \c Value of the length map. 25 25 /// 26 26 ///It is also possible to change the underlying priority heap. … … 60 60 61 61 ///The type of the length of the edges. 62 typedef typename LM::Value Type ValueType;62 typedef typename LM::Value Value; 63 63 ///The type of the map that stores the edge lengths. 64 64 typedef LM LengthMap; … … 70 70 typedef typename Graph::template NodeMap<Node> PredNodeMap; 71 71 ///The type of the map that stores the dists of the nodes. 72 typedef typename Graph::template NodeMap<Value Type> DistMap;72 typedef typename Graph::template NodeMap<Value> DistMap; 73 73 74 74 private: … … 217 217 typename GR::template NodeMap<int> heap_map(*G,1); 218 218 219 typedef Heap<Node, Value Type, typename GR::template NodeMap<int>,220 std::less<Value Type> >219 typedef Heap<Node, Value, typename GR::template NodeMap<int>, 220 std::less<Value> > 221 221 HeapType; 222 222 … … 228 228 229 229 Node v=heap.top(); 230 Value Typeoldvalue=heap[v];230 Value oldvalue=heap[v]; 231 231 heap.pop(); 232 232 distance>set(v, oldvalue); … … 262 262 ///\warning If node \c v in unreachable from the root the return value 263 263 ///of this funcion is undefined. 264 Value Typedist(Node v) const { return (*distance)[v]; }264 Value dist(Node v) const { return (*distance)[v]; } 265 265 266 266 ///Returns the 'previous edge' of the shortest path tree.
Note: See TracChangeset
for help on using the changeset viewer.