Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/theodesp/go-heaps
Reference implementations of heap data structures in Go - treap, skew, leftlist, pairing, fibonacci
https://github.com/theodesp/go-heaps
2-3-heap data-structures fibonacci-heap go heaps leftlist-heap pairing-heap rank-pairing-heap skew-heap treap
Last synced: 5 days ago
JSON representation
Reference implementations of heap data structures in Go - treap, skew, leftlist, pairing, fibonacci
- Host: GitHub
- URL: https://github.com/theodesp/go-heaps
- Owner: theodesp
- License: mit
- Created: 2018-09-28T21:00:15.000Z (about 6 years ago)
- Default Branch: master
- Last Pushed: 2022-08-17T11:27:17.000Z (over 2 years ago)
- Last Synced: 2024-10-19T09:19:49.549Z (about 1 month ago)
- Topics: 2-3-heap, data-structures, fibonacci-heap, go, heaps, leftlist-heap, pairing-heap, rank-pairing-heap, skew-heap, treap
- Language: Go
- Homepage:
- Size: 186 KB
- Stars: 97
- Watchers: 2
- Forks: 29
- Open Issues: 15
-
Metadata Files:
- Readme: README.md
- Contributing: CONTRIBUTING.md
- License: LICENSE
Awesome Lists containing this project
README
go-heaps
[](#contributors)
---
Reference implementations of heap data structures in Go
## Installation
```bash
$ go get -u github.com/theodesp/go-heaps
```
## Contents
**Heaps**
* [Pairing Heap](https://en.wikipedia.org/wiki/Pairing_heap): A pairing heap is a type of heap data structure with relatively simple implementation and excellent practical amortized performance.
* [Leftist Heap](https://www.geeksforgeeks.org/leftist-tree-leftist-heap/): a variant of a binary heap. Every node has an s-value which is the distance to the nearest leaf. In contrast to a binary heap, a leftist tree attempts to be very unbalanced.
* [Skew Heap](https://en.wikipedia.org/wiki/Skew_heap): A skew heap (or self-adjusting heap) is a heap data structure implemented as a binary tree. Skew heaps are advantageous because of their ability to merge more quickly than binary heaps.
* [Fibonacci Heap](https://en.wikipedia.org/wiki/Fibonacci_heap): a Fibonacci heap is a data structure for priority queue operations, consisting of a collection of heap-ordered trees. It has a better amortized running time than many other priority queue data structures including the binary heap and binomial heap.
* [Binomial Heap](https://www.geeksforgeeks.org/binomial-heap-2/): A Binomial Heap is a collection of Binomial Trees. A Binomial Heap is a set of Binomial Trees where each Binomial Tree follows Min Heap property. And there can be at most one Binomial Tree of any degree.
* [Treap Heap](https://en.wikipedia.org/wiki/Treap): A Treap and the randomized binary search tree are two closely related forms of binary search tree data structures that maintain a dynamic set of ordered keys and allow binary searches among the keys.
* [Rank Pairing Heap](http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.153.4644&rep=rep1&type=pdf): A heap (priority queue) implementation that combines the asymptotic efficiency of Fibonacci heaps with much of the simplicity of pairing heaps
## Usage
```go
package main
import (
"github.com/theodesp/go-heaps"
pairingHeap "github.com/theodesp/go-heaps/pairing"
"fmt"
)
func main() {
heap := pairingHeap.New()
heap.Insert(go_heaps.Integer(4))
heap.Insert(go_heaps.Integer(3))
heap.Insert(go_heaps.Integer(2))
heap.Insert(go_heaps.Integer(5))
fmt.Println(heap.DeleteMin()) // 2
fmt.Println(heap.DeleteMin()) // 3
fmt.Println(heap.DeleteMin()) // 4
fmt.Println(heap.DeleteMin()) // 5
}
```
## Complexity
| Operation | Pairing | Leftist | Skew | Fibonacci | Binomial | Treap |
| ------------- |:-------------:|:-------------:|:-------------:|:-------------:|:-------------:|:-------------:|
| FindMin | Θ(1) | Θ(1) | Θ(1) | Θ(1) | Θ(log n) | O(n) |
| DeleteMin | O(log n) | O(log n) | O(log n) | O(log n) | Θ(log n) | O(n) |
| Insert | Θ(1) | O(log n) | O(log n) | Θ(1) | Θ(1) | O(n) |
| Find | O(n) | | | | | |
| Delete | O(n) | | O(log n) | O(n) | Θ(log n) | O(n) |
| Adjust | O(n) | | O(log n) | O(n) | Θ(log n) | O(n) |
| Meld | Θ(1) | | | | | |
| Operation | Rank Pairing |
| ------------- |:-------------:|
| FindMin | Θ(1) |
| DeleteMin | O(log n) |
| Insert | Θ(1) |
| Find | O(n) |
| Delete | O(n) |
| Adjust | O(n) |
| Meld | Θ(1) |
## Contributors
Thanks goes to these wonderful people ([emoji key](https://github.com/kentcdodds/all-contributors#emoji-key)):
Miroojin Bakshi
💻
Syfaro
💻
Theofanis Despoudis
💻
Radliński Ignacy
💻
Don McNamara
🚇
Afrizal Fikri
💻
Logan HAUSPIE
💻
Song Guo
💻
Safwan Mohammed
⚠️ 💻
This project follows the [all-contributors](https://github.com/kentcdodds/all-contributors) specification. Contributions of any kind welcome!
## LICENCE
Copyright © 2017 Theo Despoudis MIT license