Kinetic heap
id:
kinetic-heap-324-9207892
title:
Kinetic heap
text:
A Kinetic Heap is a kinetic data structure, obtained by the kinetization of a heap. It is designed to store elements where the priority is changing as a continuous function of time. As a type of kinetic priority queue, it maintains the maximum priority element stored in it. The kinetic heap data structure works by storing the elements as a tree that satisfies the following heap property – if B is a child node of A, then the priority of the element in A must be higher than the priority of the ele
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Kinetic_heap
date created:
date modified:
2024-04-21T09:08:10Z
main entity:
{"identifier":"Q6410783","url":"https://www.wikidata.org/entity/Q6410783"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/0/06/Kinetic_heap_overview.png","width":407,"height":180}
fields total:
13
integrity:
14