Fibonacci Heap — Interactive Visualization
forest of heap-ordered trees · root list · cascading cuts · potential function Φ
default
min
marked
comparing
cutting
linking
Heap Forest
n (size)
0
# roots
0
# marked
0
Φ = R + 2M
0
max degree
0
Operations
Insert
Insert
Rand
Extract Min
Selected node
click a node to select
Decrease Key
Decrease
Delete Selected
Meld with random heap
Reset
Playback
Step
Play
Speed
650ms
Step Narration
Ready. Insert nodes, then try Extract-Min to trigger consolidate.
Operation Log