PineWikiA specialized heap that provides an O(log n) time EXTRACT-MIN operation and an O(1) amortized time DECREASE-KEY operation. Fibonacci heaps are described in excruciating detail in Chapter 20 of CormenEtAl. There is also a very brief description at [Fibonacci_heap] and an animated demo at http://www-users.cs.umn.edu/~janardan/FHEAP/.