proxy.golang.org : github.com/gammazero/heap
Package heap provides a generic implementation of a heap. 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, create a Heap of the type of elements it will hold and specify a "less" function that orders the elements by priority. Use `Push` to add items and `Pop` to remove the item with the greatest precedence.
Registry
-
Source
- Documentation
- JSON
purl: pkg:golang/github.com/gammazero/heap
License: MIT
Latest release: 3 months ago
Namespace: github.com/gammazero
Stars: 0 on GitHub
Forks: 0 on GitHub
See more repository details: repos.ecosyste.ms
Last synced: 3 months ago