Fibonacci heap

(data structure)

Definition: A heap made of a forest of trees. The amortized cost of the operations create, insert a value, decrease a value, find minimum, and merge or join (meld) two heaps, is a constant Θ(1). The delete operation takes O(log n).

Generalization (I am a kind of ...)
heap.

Aggregate parent (I am a part of or used in ...)
priority queue, Dijkstra's algorithm.

Note: After [CLR90, page 421].

Author: PEB

Implementation

John Boyer's code for ExtractMin and DecreaseKey (C++) and fibheap.h, the include file it needs.

More information

Michael L. Fredman and Robert Endre Tarjan, Fibonacci heaps and their uses in improved network optimization algorithms, Journal of the ACM, 34(3):596-615, July, 1987.

Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.

Entry modified 1 October 2007.
HTML page formatted Mon Oct 1 10:28:55 2007.

Cite this as:
Paul E. Black, "Fibonacci heap", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed., U.S. National Institute of Standards and Technology. 1 October 2007. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/fibonacciHeap.html