GraphLib
Bearbeitung der Aufgabe Mini Graph Library für OOP WiSe 2023/24
Loading...
Searching...
No Matches
util.h
Go to the documentation of this file.
1
#ifndef GRAPHLIB_INTERNAL_UTIL_H
2
#define GRAPHLIB_INTERNAL_UTIL_H
3
10
11
namespace
GraphLib::Internal {
12
22
template
<
typename
P,
typename
T>
23
struct
PriorityPair
{
24
P
priority
;
25
T
value
;
26
33
explicit
PriorityPair
(P
priority
, T
value
) :
priority
(
priority
),
value
(
value
) {};
34
43
bool
operator>
(
const
PriorityPair
& right)
const
44
{
45
return
priority
> right.
priority
;
46
}
47
};
48
49
}
// namespace GraphLib::Internal
50
51
#endif
GraphLib::Internal::PriorityPair::PriorityPair
PriorityPair(P priority, T value)
Constructs a PriorityPair with given priority and value.
Definition
util.h:33
GraphLib::Internal::PriorityPair< edge_weight_type, value_type >::priority
edge_weight_type priority
Definition
util.h:24
GraphLib::Internal::PriorityPair::operator>
bool operator>(const PriorityPair &right) const
Greater-than operator comparing by priority.
Definition
util.h:43
GraphLib::Internal::PriorityPair< edge_weight_type, value_type >::value
value_type value
Definition
util.h:25
include
GraphLib
internal
util.h
Generated by
1.14.0