d-ary heap
Sign in to saveAlso known as d-heap
priority queue data structure, a generalization of the binary heap in which the nodes have d children instead of 2
In the Vinony graph
Vinony's link graph records 90 inbound references to d-ary heap, and connects out to cache, International Standard Book Number and digital object identifier.
It is catalogued under the topic Heaps (data structures).
Vinony links it to 5 Wikipedia language editions.
Wikidata facts
- Subclass of
- heap
Show 2 more facts
- Commons category
- Algorithms
- studied by
- graph theory
via Wikidata · CC0