Package heap implements indexed minimum Fibonacci priority queue.
Package deheap provides a doubly-ended heap (min-max heap).
Package fibHeap implements the Fibonacci Heap priority queue.
Package binaryheap implements a binary heap backed by array list.
Package heap provides a generic, type-safe priority queue backed by container/heap.
Package heapx: Generic indexed min-heap with Fix/Remove support Wraps container/heap with generics, each node tracks its own heap index Enables O(log n) updates via Fix, no heap.Interface boilerplate needed
Package heap provides a generic min or max heap that can be used as a priority queue.
Package heap provides heap operations for any type that implements heap.Interface. A heap is a tree with the property that each node is the minimum-valued node in its subtree. The minimum element in the tree is the root, at index 0. A heap is a common way to implement a priority queue. To build a priority queue, implement the Heap interface with the (negative) priority as the ordering for the Less method, so Push adds items while Pop removes the highest-priority item from the queue. The Examples include such an implementation; the file example_pq_test.go has the complete source. This example inserts several ints into an IntHeap, checks the minimum, and removes them in order of priority. This example creates a PriorityQueue with some items, adds and manipulates an item, and then removes the items in priority order.
Package heapfast provides high-performance generic heap implementations in Go.
Package heap provides a min-heap data structure.
Package heap implements a generic heap based on the standard library's container/heap package.
Package heap provides a generic, type-safe heap implementation.
Package minmaxheap provides min-max heap operations for any type that implements heap.Interface.
Package heap provides heap operations for any type that implements heap.Interface.