Binary Heap
A priority queue implemented as binary heap.
Comparison
Why not @jviide/sorted-queue?
Beacause it cannot predicate if the element referenced by a specified pointer has already been removed.
A priority queue implemented as binary heap.
Why not @jviide/sorted-queue?
Beacause it cannot predicate if the element referenced by a specified pointer has already been removed.
npm i @zimtsui/binary-heap
1
0.0.5
none
26.4 kB
11