Changeset 987:87f7c54892df in lemon-0.x for src/lemon/dijkstra.h

Timestamp:

11/13/04 18:07:10 (19 years ago)

Author:

Alpar Juttner

Branch:

default

Phase:

public

Convert:

svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1377

Message:

Naming changes:

• ValueType? -> Value
• KeyType? -> Key
• ReferenceType? ->Reference
• PointerType? -> Pointer

File:

• src/lemon/dijkstra.h (modified) (6 diffs)

src/lemon/dijkstra.h

@@ -38 +38 @@
   ///
   ///The type of the length is determined by the
-  ///\ref concept::ReadMap::ValueType "ValueType" of the length map.
+  ///\ref concept::ReadMap::Value "Value" of the length map.
   ///
   ///It is also possible to change the underlying priority heap.
@@ -82 +82 @@
     
     ///The type of the length of the edges.
-    typedef typename LM::ValueType ValueType;
+    typedef typename LM::Value Value;
     ///The type of the map that stores the edge lengths.
     typedef LM LengthMap;
@@ -92 +92 @@
     typedef typename Graph::template NodeMap<Node> PredNodeMap;
     ///The type of the map that stores the dists of the nodes.
-    typedef typename Graph::template NodeMap<ValueType> DistMap;
+    typedef typename Graph::template NodeMap<Value> DistMap;
 
   private:
@@ -238 +238 @@
       typename GR::template NodeMap<int> heap_map(*G,-1);
       
-      typedef Heap<Node, ValueType, typename GR::template NodeMap<int>,
-      std::less<ValueType> > 
+      typedef Heap<Node, Value, typename GR::template NodeMap<int>,
+      std::less<Value> > 
       HeapType;
       
@@ -249 +249 @@
         
         Node v=heap.top(); 
-        ValueType oldvalue=heap[v];
+        Value oldvalue=heap[v];
         heap.pop();
         distance->set(v, oldvalue);
@@ -282 +282 @@
     ///\warning If node \c v in unreachable from the root the return value
     ///of this funcion is undefined.
-    ValueType dist(Node v) const { return (*distance)[v]; }
+    Value dist(Node v) const { return (*distance)[v]; }
 
     ///Returns the 'previous edge' of the shortest path tree.