Fibonacci Heap Decrease-Key
Cut the node to the root list. Cascading cuts keep the potential bounded.
Binomial and Fibonacci Heaps: Decrease-key: one cut
41 becomes 9. Its parent is 23, which is now larger: heap order is broken between exactly these two nodes, so 9 is cut and joins the root list, and the parent takes a mark.
Cost
- Best
- O(1)
- Average
- O(1) amortized
- Worst
- O(log n)
- Space
- O(1)
Before this
Taught by the same lesson
Binomial and Fibonacci Heaps covers these too, in the same run.