Strict fibonacci heaps
Gerth Stølting Brodal, George Lagogiannis, Robert Endre Tarjan · 2012
We present the first pointer-based heap implementation with time bounds matching those of Fibonacci heaps in the worst case. We support make-heap, insert, find-min, meld and decrease-key in worst-case O(1) time, and delete and delete-min in worst-case O(lg n) time, where n is the size of the heap. The data structure uses linear space.