[FrontPage] [TitleIndex] [WordIndex] 

Note: You are looking at a static copy of the former PineWiki site, used for class notes by James Aspnes from 2003 to 2012. Many mathematical formulas are broken, and there are likely to be other bugs as well. These will most likely not be fixed. You may be able to find more up-to-date versions of some of these notes at http://www.cs.yale.edu/homes/aspnes/#classes.

A 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/.

CategoryAlgorithmNotes

2014-06-17 11:58