DagLongestPathOperationTraits< Value, has_infinity > Struct Template Reference
Detailed Description
template<typename Value, bool has_infinity = std::numeric_limits<Value>::has_infinity>
struct lemon::DagLongestPathOperationTraits< Value, has_infinity >
It defines all computational operations and constants which are used in the dag shortest path algorithm. It is the inverse of
DagShortestPathDefaultOperationTraits, so it can be used to calculate the longest path. The default implementation is based on the numeric_limits class. If the numeric type does not have infinity value then the minimum value is used as extremal infinity value.
#include <lemon/dag_shortest_path.h>
List of all members.
|
Static Public Member Functions |
static Value | zero () |
| Gives back the zero value of the type.
|
static Value | infinity () |
| Gives back the negative infinity value of the type.
|
static Value | plus (const Value &left, const Value &right) |
| Gives back the sum of the given two elements.
|
static bool | less (const Value &left, const Value &right) |
| Gives back true only if the first value less than the second.
|