Abstract

Fibonacci heap is a variant of heap, developed by Fredman and Tarjan with the purpose of improving Dijkstra’s shortest path algorithm. Fibonacci heap is a first heap that accomplishes insert and decrease key operations in constant amortized time with logarithmic time for deleting the elements. Because of the importance of Fibonacci heap in the field of computer science, this work describes Fibonacci heap and its influence on the field of combinatorial optimization. Analysis on the influence of Fibonacci heaps in Dijkstra’s and Prim’s algorithms has been made, in respect to some other possible implementations of priority queue.