This visualisation uses AI Generated code, finetuned for the best visualisation, not code quality
heappriorityqueue.mov
Interactive C + Raylib visualizer for binary heaps and priority queues, combining the implicit-array view, tree topology view, and operation inspector in one interface.
- How a binary heap lives simultaneously as an array and a tree
- How insert, extract, and heapify operations bubble values through the structure
- How the heap invariant can be inspected visually after each change
- A control-heavy inspector aimed at debugging and intuition together
flowchart LR
A["Heap Array"]
B["Implicit Tree Topology"]
C["Insert / Extract Operation"]
D["Bubble Up / Down"]
E["Restore Heap Invariant"]
A --> B
B --> C
C --> D
D --> E
q: quit- The controls modal and top-level UI expose the main operations and tuning sliders
- Mouse-first interactions drive the common heap operations
make run