COIN-OR::LEMON - Graph Library

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


Ignore:
Timestamp:
11/13/04 18:07:10 (16 years ago)
Author:
Alpar Juttner
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1377
Message:

Naming changes:

File:
1 edited

Legend:

Unmodified
Added
Removed
  • src/lemon/dijkstra.h

    r986 r987  
    3838  ///
    3939  ///The type of the length is determined by the
    40   ///\ref concept::ReadMap::ValueType "ValueType" of the length map.
     40  ///\ref concept::ReadMap::Value "Value" of the length map.
    4141  ///
    4242  ///It is also possible to change the underlying priority heap.
     
    8282   
    8383    ///The type of the length of the edges.
    84     typedef typename LM::ValueType ValueType;
     84    typedef typename LM::Value Value;
    8585    ///The type of the map that stores the edge lengths.
    8686    typedef LM LengthMap;
     
    9292    typedef typename Graph::template NodeMap<Node> PredNodeMap;
    9393    ///The type of the map that stores the dists of the nodes.
    94     typedef typename Graph::template NodeMap<ValueType> DistMap;
     94    typedef typename Graph::template NodeMap<Value> DistMap;
    9595
    9696  private:
     
    238238      typename GR::template NodeMap<int> heap_map(*G,-1);
    239239     
    240       typedef Heap<Node, ValueType, typename GR::template NodeMap<int>,
    241       std::less<ValueType> >
     240      typedef Heap<Node, Value, typename GR::template NodeMap<int>,
     241      std::less<Value> >
    242242      HeapType;
    243243     
     
    249249       
    250250        Node v=heap.top();
    251         ValueType oldvalue=heap[v];
     251        Value oldvalue=heap[v];
    252252        heap.pop();
    253253        distance->set(v, oldvalue);
     
    282282    ///\warning If node \c v in unreachable from the root the return value
    283283    ///of this funcion is undefined.
    284     ValueType dist(Node v) const { return (*distance)[v]; }
     284    Value dist(Node v) const { return (*distance)[v]; }
    285285
    286286    ///Returns the 'previous edge' of the shortest path tree.
Note: See TracChangeset for help on using the changeset viewer.