Changes in / [398:532f34ea9cf3:396:c5f010a5647a] in lemon-1.1
- Files:
-
- 2 edited
Legend:
- Unmodified
- Added
- Removed
-
lemon/dijkstra.h
r397 r313 48 48 static Value plus(const Value& left, const Value& right) { 49 49 return left + right; 50 } 51 /// \brief Gives back true only if the first value is less than the second. 52 static bool less(const Value& left, const Value& right) { 53 return left < right; 54 } 55 }; 56 57 /// \brief Widest path operation traits for the Dijkstra algorithm class. 58 /// 59 /// This operation traits class defines all computational operations and 60 /// constants which are used in the Dijkstra algorithm for widest path 61 /// computation. 62 /// 63 /// \see DijkstraDefaultOperationTraits 64 template <typename Value> 65 struct DijkstraWidestPathOperationTraits { 66 /// \brief Gives back the maximum value of the type. 67 static Value zero() { 68 return std::numeric_limits<Value>::max(); 69 } 70 /// \brief Gives back the minimum of the given two elements. 71 static Value plus(const Value& left, const Value& right) { 72 return std::min(left, right); 50 73 } 51 74 /// \brief Gives back true only if the first value is less than the second. -
test/dijkstra_test.cc
r397 r293 90 90 ::SetProcessedMap<concepts::WriteMap<Node,bool> > 91 91 ::SetStandardProcessedMap 92 ::SetOperationTraits<Dijkstra DefaultOperationTraits<VType> >92 ::SetOperationTraits<DijkstraWidestPathOperationTraits<VType> > 93 93 ::SetHeap<BinHeap<VType, concepts::ReadWriteMap<Node,int> > > 94 94 ::SetStandardHeap<BinHeap<VType, concepts::ReadWriteMap<Node,int> > >
Note: See TracChangeset
for help on using the changeset viewer.