Fibonacci Heap Algorithm

It is also possible to merge two Fibonacci heaps in constant amortized time, better on the logarithmic merge time of a binomial heap, and better on binary heaps which can not handle merges efficiently. use Fibonacci heaps for priority queues improves the asymptotic running time of important algorithms, such as Dijkstra's algorithm for compute the shortest path between two nodes in a graph, compared to the same algorithm use other slower priority queue data structures.

Fibonacci Heap source code, pseudocode and analysis