Fibonacci Heaps

Dijkstra’s uses |V| deleteMins and |E| decreaseKeys

runtime with Fibonacci heaps:

• Somewhat like Binomial Queues with lazy merges

• Amortized O(1) time bound for decreaseKey

• O(log n) time for deleteMin

Previous slide

Next slide

Back to first slide

View graphic version