Public Member Functions |
| | Prioritized () |
| | Constructor of empty element. Be careful!
|
| | Prioritized (X xt, Priority pt) |
| | Constructor using a key/value pair.
|
| | Prioritized (const Prioritized &P) |
| | Copy-constructor.
|
| X | item () const |
| | Returns the data of the element.
|
| bool | operator!= (const Prioritized< X, Priority > &P) const |
| | Comparison oprator based on the compare-operator for the key type (Priority)
|
| bool | operator< (const Prioritized< X, Priority > &P) const |
| | Comparison oprator based on the compare-operator for the key type (Priority)
|
| bool | operator<= (const Prioritized< X, Priority > &P) const |
| | Comparison oprator based on the compare-operator for the key type (Priority)
|
| bool | operator== (const Prioritized< X, Priority > &P) const |
| | Comparison oprator based on the compare-operator for the key type (Priority)
|
| bool | operator> (const Prioritized< X, Priority > &P) const |
| | Comparison oprator based on the compare-operator for the key type (Priority)
|
| bool | operator>= (const Prioritized< X, Priority > &P) const |
| | Comparison oprator based on the compare-operator for the key type (Priority)
|
| Priority | priority () const |
| | Returns the key of the element.
|
template<class X, class Priority = double>
class ogdf::Prioritized< X, Priority >
Augments any data elements of type X with keys of type Score.
Also defines comparator function using the keys. This class is intended as a helpful convenience class for using with BinaryHeapSimple, Top10Heap,..
Definition at line 59 of file MinHeap.h.
