Random Insert: Make a new heap with N random nodes, each with a unique key
Insert: Insert the corresponding key into the heap
Decrease Key: Select a target node by clicking on it in the tree, and enter the final key (should be < current key)
Delete Min: delete the minimum node/root
Active Root Reduction Ready(part 1) Single Active Roots of Rank x(part 2) Active Nodes with Loss 1(part 3) Loss Reduction Ready(part 4)
Current logs:
The analysis on this site is based on Strict Fibonacci Heaps