[−][src]Module rudac::heap
Structs
BinomialHeap | A binomial heap is a data structure that acts as a priority queue but also allows pairs of heaps to be merged together |
FibonacciHeap | A Fibonacci heap is a data structure for priority queue operations. It has a better amortized running time than binary heap and binomial heap. |
MinMax | A min-max heap provides constant time retrieval and logarithmic time removal of both the min and max elements in it. This makes the min-max heap a very useful data structure to implement a double-ended priority queue |