Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/bgadrian/data-structures
Abstract data structures Go packages, built with performance and concurrency in mind to learn Go.
https://github.com/bgadrian/data-structures
concurrency go golang learning-golang
Last synced: 5 days ago
JSON representation
Abstract data structures Go packages, built with performance and concurrency in mind to learn Go.
- Host: GitHub
- URL: https://github.com/bgadrian/data-structures
- Owner: bgadrian
- License: mit
- Created: 2017-08-26T13:27:45.000Z (about 7 years ago)
- Default Branch: master
- Last Pushed: 2022-12-16T18:35:35.000Z (almost 2 years ago)
- Last Synced: 2023-07-27T21:57:23.256Z (over 1 year ago)
- Topics: concurrency, go, golang, learning-golang
- Language: Go
- Homepage:
- Size: 93.8 KB
- Stars: 64
- Watchers: 7
- Forks: 3
- Open Issues: 1
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# Data structures in Go [](https://travis-ci.org/bgadrian/data-structures) [](https://codecov.io/gh/bgadrian/data-structures) [](https://goreportcard.com/report/github.com/bgadrian/data-structures)
I am writing a collection of packages for different data structures in GO.
Why? To learn Go, practice basic structures and learning to code fast concurrent algorithms.
All the packages have 100+% test coverage, benchmark tests and godocs. Tested with go 1.9.
#### !! Warning This library wasn't used in production (yet). !!
## [priorityqueue](priorityqueue/README.md) [](https://godoc.org/github.com/bgadrian/data-structures/priorityqueue)
A collection of performant, concurrent safe, complex abstract data structures used for priority queues.
*Priority queue is an abstract data type which is like a regular queue or stack data structure, but where additionally each element has a "priority" associated with it. In a priority queue, an element with high priority is served before an element with low priority.*
### [Hierarchical Queue](priorityqueue/README.md) [description](https://www.researchgate.net/figure/261191274_fig1_Figure-1-Simple-queue-a-and-hierarchical-queue-b)
An **O(1)/O(1+K) priority queue (very fast)** implementation for small integers, that uses an assembly of N simple queues. It is optimized for large amount of data BUT with small value priorities ( **<= 255** ). Can store any type of elements/values.
### [Hierarchical Heap](priorityqueue/README.md)
It is a modification of the Hierarchical Queue structure, adding some complexity (O(log n/k)) but removing it's limitations. With the right parameters can be **fast**, only 3-4 times slower than a HQ for 1M elements. Can store any type of elements/values.
Inspired by [Cris L. Luengo Hendriks paper](http://www.cb.uu.se/~cris/Documents/Luengo2010a_preprint.pdf)
## [heap](heap/README.md) [](https://godoc.org/github.com/bgadrian/data-structures/heap)
A collection of basic abstract heap data structures.
### Implicit Heap [description](http://www.cs.princeton.edu/courses/archive/spr09/cos423/Lectures/i-heaps.pdf) [example](https://www.tutorialspoint.com/data_structures_algorithms/heap_data_structure.htm)
Dynamic Min & Max Implicit heaps.
Insert (push) and remove min/max (pop) have ```O(log n)``` complexity. The keys are ```int```and values can be any type ```interface{}```.
## [graph](graph/README.md) [](https://godoc.org/github.com/bgadrian/data-structures/graph)
A collection of simple graph data structures, used for **academic purposes**.
### AdjacencyList [description](https://en.wikipedia.org/wiki/Adjacency_list)
AdjacencyList is a collection of unordered lists used to represent a finite graph. The graph is undirected with values on nodes and edges.
A collection of simple graph data structures, used for **academic purposes**.
### AdjacencyListDirected
It is a AdjacencyList with 3 extra functions, that allow 1 direction edge control.
## [tree](tree/README.md) [](https://godoc.org/github.com/bgadrian/data-structures/tree)
Package tree contains simple Tree implementations for academic purposes.
### BST [description](https://en.wikipedia.org/wiki/Binary_search_tree)
A basic implementation of a Binary Search Tree with nodes: `key(int), value(interface{})`.
## [linear](linear/README.md) [](https://godoc.org/github.com/bgadrian/data-structures/linear)
A collection of simple linear data structres, that are not in the standard Go lib, built for academic purposes.
### Stack [description](https://www.tutorialspoint.com/data_structures_algorithms/stack_algorithm.htm)
Basic stack (FILO) using the builtin linked list, can store any type, concurrency safe, no size limit, implements Stringer.
### Queue [description](https://www.tutorialspoint.com/data_structures_algorithms/dsa_queue.htm)
Basic queue (FIFO) using the builtin linked list, can store any type, concurrency safe (optional mutex), no size limit, implements Stringer.
## [Multi-Pivot QuickSort](sort/multipivotquicksort/README.md) [](https://godoc.org/github.com/bgadrian/data-structures/sort/multipivotquicksort)
MultiPivot uses a variant of the QuickSort algorithm with multiple pivots, splitting the arrays in multiple segments (pivots+1). It can be used to sort large arrays.