Growing with the Web


My name is Daniel Imms and I'm a software engineer from Australia. I live in Seattle and work at Amazon on the Silk Web Browser. I use this blog as a platform to learn, revise and teach various software development topics.

A Fibonacci heap is a heap data structure similar to the binomial heap, only with a few modifications and a looser structure. The Fibonacci heap was designed in order to improve Dijkstra's shortest path algorithm from \(O(m \log n)\) to \(O(m + n \log n)\) by optimising the operations used most by the algorithm. Its name derives from the fact that the Fibonacci sequence is used in the complexity analysis of its operations.