Implementation of Heap-on-Top data structure. More...
#include <cmath>
#include <functional>
#include <limits>
#include <utility>
#include <vector>
Go to the source code of this file.
Classes | |
class | ogdf::HotQueue< V, P, H > |
Heap-on-Top queue implementation. More... | |
struct | ogdf::HotQueue< V, P, H >::HeapComparator |
Comparator used by underlying heap. More... | |
struct | ogdf::HotQueueHandle< V, P, HeapHandle > |
Heap-on-Top handle to inserted items. More... | |
struct | ogdf::HotQueueNode< V, P > |
Heap-on-Top bucket element. More... | |
Namespaces | |
namespace | ogdf |
The namespace for all OGDF objects. | |
Implementation of Heap-on-Top data structure.
Definition in file HotQueue.h.