Originally developed by Michael L. Fredman and Robert E. Tarjan in 1984 and first published in a scientific journal in 1987, the name Fibonacci heap comes from Fibonacci numbers which are used in the running time analysis.
The Fibonacci heap is a heap consisting of a collection of trees which satisfy the minimum-heap property.
Fibonacci heaps offers better amortized running time than binomial and binary heaps.
|Heaps||Heapify||Find Max||Extract Max||Increase Key||Insert||Delete||Merge|
Wikipedia: Fibonacci heap