Priority queue interface wrapping various heaps. More...
#include <ogdf/basic/Graph.h>
#include <ogdf/basic/HashArray.h>
#include <ogdf/basic/Hashing.h>
#include <ogdf/basic/basic.h>
#include <ogdf/basic/heap/PairingHeap.h>
#include <cstddef>
#include <functional>
#include <initializer_list>
Go to the source code of this file.
Classes | |
class | ogdf::pq_internal::Compare< T, C > |
Used to compare elements with assigned priorities. More... | |
class | ogdf::pq_internal::PairTemplate< E, P > |
Pair for storing an element and a priority. More... | |
class | ogdf::pq_internal::PrioritizedArrayQueueBase< E, P, C, Impl, Map > |
class | ogdf::pq_internal::PrioritizedQueue< E, P, C, Impl > |
Defines a queue for handling prioritized elements. More... | |
class | ogdf::PrioritizedMapQueue< E, P, C, Impl, HashFunc > |
Prioritized queue interface wrapper for heaps. More... | |
class | ogdf::PrioritizedMapQueue< edge, P, C, Impl, HashFunc > |
Specialization for edge elements. More... | |
class | ogdf::PrioritizedMapQueue< node, P, C, Impl, HashFunc > |
Specialization for node elements. More... | |
class | ogdf::PriorityQueue< T, C, Impl > |
Priority queue interface wrapper for heaps. More... | |
Namespaces | |
ogdf | |
The namespace for all OGDF objects. | |
ogdf::pq_internal | |
This namespace contains helper classes to keep the code dry. | |
Typedefs | |
template<typename E , typename P , class C = std::less<P>, template< typename, class > class Impl = PairingHeap> | |
using | ogdf::PrioritizedQueue = pq_internal::PrioritizedQueue< E, P, C, Impl > |
Prioritized queue interface wrapper for heaps. More... | |
template<typename E , typename P , class C , template< typename, class > class Impl> | |
using | ogdf::pq_internal::SuperQueueTemplate = PriorityQueue< PairTemplate< E, P >, Compare< PairTemplate< E, P >, C >, Impl > |
Shortcut for PriorityQueue, the base class of PrioritizedQueue. More... | |
Priority queue interface wrapping various heaps.
Definition in file PriorityQueue.h.