Changeset 987:87f7c54892df in lemon-0.x for src/work/alpar/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/work/alpar/dijkstra.h (modified) (8 diffs)

src/work/alpar/dijkstra.h

@@ -47 +47 @@
     typedef LM LengthMap;
     //The type of the length of the edges.
-    typedef typename LM::ValueType ValueType;
+    typedef typename LM::Value Value;
     ///The heap type used by Dijkstra algorithm.
 
@@ -55 +55 @@
     ///\sa Dijkstra
     typedef BinHeap<typename Graph::Node,
-                    typename LM::ValueType,
+                    typename LM::Value,
                     typename GR::template NodeMap<int>,
-                    std::less<ValueType> > Heap;
+                    std::less<Value> > Heap;
 
     ///\brief The type of the map that stores the last
@@ -91 +91 @@
     ///It must meet the \ref concept::WriteMap "WriteMap" concept.
     ///
-    typedef typename Graph::template NodeMap<typename LM::ValueType> DistMap;
+    typedef typename Graph::template NodeMap<typename LM::Value> DistMap;
     ///Instantiates a DistMap.
  
@@ -110 +110 @@
   ///
   ///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.
@@ -159 +159 @@
     
     ///The type of the length of the edges.
-    typedef typename TR::LengthMap::ValueType ValueType;
+    typedef typename TR::LengthMap::Value Value;
     ///The type of the map that stores the edge lengths.
     typedef typename TR::LengthMap LengthMap;
@@ -388 +388 @@
         
         Node v=heap.top(); 
-        ValueType oldvalue=heap[v];
+        Value oldvalue=heap[v];
         heap.pop();
         distance->set(v, oldvalue);
@@ -421 +421 @@
     ///\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.
@@ -498 +498 @@
     typedef typename TR::LengthMap LengthMap;
     ///The type of the length of the edges.
-    typedef typename LengthMap::ValueType ValueType;
+    typedef typename LengthMap::Value Value;
     ///\brief The type of the map that stores the last
     ///edges of the shortest paths.