byheapAn efficient es6 implementation of priority queue using binary heap data structurenpmes6priority queueoptimizationefficientheapbinary heapmax heapmin heapheapsort1.0.11 • Published 5 years ago
min-heap-typedMin HeapMin Heapmin heapmaxheapmin-heapheapBinary Heapbinary-heapheap data structuremin heap data structuremin heap2.0.3 • Published 5 months ago
min-priority-queue-typedMin Priority QueueMin Priority Queuemin priority queueminpriorityqueuemin-priority-queuePriority Queuepriority queuepriorityqueuepriority-queuepriority qpriorityQ2.0.3 • Published 5 months ago
priority-queue-typedPriority QueuePriority Queuepriority queuepriorityqueuepriority-queuepriority qpriorityQminmaxefficientpriority2.0.3 • Published 5 months ago
heap-typedHeapheapBinary Heapbinary-heapheap data structuremin heapmax heapcomplete binary treeheapifyheap sortheapify up2.0.3 • Published 5 months ago
max-priority-queue-typedMax Priority QueueMax Priority Queuemax priority queuemax-priority-queuemaxpriorityqueuemax valueextract maximumPriority Queuepriority queuepriorityqueuepriority-queue2.0.3 • Published 5 months ago