Fibonacci Heap
A heap data structure proposed by Fredman and Tarjan in 1987 that supports decrease-key operations in amortized O(1) time. It theoretically improves the complexity of Dijkstra's algorithm on dense graphs, but its poor cache locality limits its use in engineering practice.
Timeline (last 90 days)
In 1987, Fredman and Tarjan proposed the Fibonacci heap, reducing the complexity of Dijkstra's algorithm to the more precise form of O(m + n log n).
Due to frequent pointer operations and poor cache locality, the Fibonacci heap has almost never replaced the binary heap in practice.
All Facts (2)
In 1987, Fredman and Tarjan proposed the Fibonacci heap, reducing the complexity of Dijkstra's algorithm to the more precise form of O(m + n log n).
50%UnverifiedDue to frequent pointer operations and poor cache locality, the Fibonacci heap has almost never replaced the binary heap in practice.
50%