proxy.golang.org : github.com/ksw2000/go-fibheap
Package fibheap implements a Fibonacci heap. A Fibonacci heap is a data structure for priority queue operations, consisting of a collection of heap-ordered trees. The amortized time complexity of Fibonacci heap operations are as follows: fetching the minimum is Θ(1), extracting the minimum is O(log n), inserting is Θ(1), decreasing a key is Θ(1), and merging two heaps is Θ(1). In our implementation, we do not additionally track the key value of each element. Therefore, users should be aware that they should not insert elements with the same key into the Fibonacci heap.
Registry
-
Source
- Documentation
- JSON
purl: pkg:golang/github.com/ksw2000/go-fibheap
Keywords:
go
, heap
License: MIT
Latest release: 10 months ago
First release: 10 months ago
Namespace: github.com/ksw2000
Stars: 0 on GitHub
Forks: 0 on GitHub
See more repository details: repos.ecosyste.ms
Last synced: about 1 month ago