Changeset 987:87f7c54892df in lemon-0.x for src/lemon/dijkstra.h
- Timestamp:
- 11/13/04 18:07:10 (20 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1377
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
src/lemon/dijkstra.h
r986 r987 38 38 /// 39 39 ///The type of the length is determined by the 40 ///\ref concept::ReadMap::Value Type "ValueType" of the length map.40 ///\ref concept::ReadMap::Value "Value" of the length map. 41 41 /// 42 42 ///It is also possible to change the underlying priority heap. … … 82 82 83 83 ///The type of the length of the edges. 84 typedef typename LM::Value Type ValueType;84 typedef typename LM::Value Value; 85 85 ///The type of the map that stores the edge lengths. 86 86 typedef LM LengthMap; … … 92 92 typedef typename Graph::template NodeMap<Node> PredNodeMap; 93 93 ///The type of the map that stores the dists of the nodes. 94 typedef typename Graph::template NodeMap<Value Type> DistMap;94 typedef typename Graph::template NodeMap<Value> DistMap; 95 95 96 96 private: … … 238 238 typename GR::template NodeMap<int> heap_map(*G,-1); 239 239 240 typedef Heap<Node, Value Type, typename GR::template NodeMap<int>,241 std::less<Value Type> >240 typedef Heap<Node, Value, typename GR::template NodeMap<int>, 241 std::less<Value> > 242 242 HeapType; 243 243 … … 249 249 250 250 Node v=heap.top(); 251 Value Typeoldvalue=heap[v];251 Value oldvalue=heap[v]; 252 252 heap.pop(); 253 253 distance->set(v, oldvalue); … … 282 282 ///\warning If node \c v in unreachable from the root the return value 283 283 ///of this funcion is undefined. 284 Value Typedist(Node v) const { return (*distance)[v]; }284 Value dist(Node v) const { return (*distance)[v]; } 285 285 286 286 ///Returns the 'previous edge' of the shortest path tree.
Note: See TracChangeset
for help on using the changeset viewer.