Fibonacci Heaps
An introduction to and amortized analysis of Fibonacci heaps. Fibonacci heaps are the (theoretical) ingredient to use to get a fast version of Dijkstra's algorithm.
The video assumes you know the potential method and ideally also Binomial heaps with lazy union (Videos for all of this are in my Advanced Algorithms playlist).
00:00 introductions
04:26 basic operations
06:45 deleteMinimum
14:05 decreaseKey
18:43 analysis for decreaseKey
23:05 Bounding D(n) (intuition)
25:43 Bounding D(n) (proof)
27:23 Lemma 1
29:28 Lemma 2+3
32:15 Lemma 4