Changes in lemon/dijkstra.h [412:62f9787c516c:313:64f8f7cc6168] in lemon
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

lemon/dijkstra.h
r412 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.
Note: See TracChangeset
for help on using the changeset viewer.