May 26, 2018
Fibonacci Heap Library
This is an implementation of a Fibonacci Heap. A Fibonacci Heap is a very efficient heap. The cost of an insert is O1, and the amortized cost of an extract minimum is Olgn. You can extract an already inserted item out of order in Olgn. The way the Fibonacci heap obtains this is by delaying the organizing of the items until you extract.