Data structureresearch
Kinetic heap
Also called kinetic tournament, kinetic priority queue.
Heap over moving keys that maintains the minimum as keys change continuously over time.
Heap over moving keys that maintains the minimum as keys change continuously over time.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag NF6DCE Edit this page History Report an error