Popularity
7.2
Growing
Activity
0.0
Stable
689
22
111
Programming language: Go
License: MIT License
Tags:
Data Structures
algorithms alternatives and similar packages
Based on the "Data Structures" category.
Alternatively, view algorithms alternatives based on common mentions on social networks and blogs.
-
gods
GoDS (Go Data Structures) - Sets, Lists, Stacks, Maps, Trees, Queues, and much more -
go-datastructures
A collection of useful, performant, and threadsafe Go datastructures. -
golang-set
A simple generic set type for the Go language. Trusted by Docker, 1Password, Ethereum and Hashicorp. -
gocache
☔️ A complete Go cache library that brings you multiple ways of managing your caches -
boomfilters
Probabilistic data structures for processing continuous, unbounded streams. -
gostl
Data structure and algorithm library for go, designed to provide functions similar to C++ STL -
hyperloglog
HyperLogLog with lots of sugar (Sparse, LogLog-Beta bias correction and TailCut space reduction) -
trie
Data structure and relevant algorithms for extremely fast prefix/fuzzy string searching. -
go-geoindex
Go native library for fast point tracking and K-Nearest queries -
ttlcache
An in-memory cache with item expiration and generics [Moved to: https://github.com/jellydator/ttlcache] -
hilbert
Go package for mapping values to and from space-filling curves, such as Hilbert and Peano curves. -
Bloomfilter
Face-meltingly fast, thread-safe, marshalable, unionable, probability- and optimal-size-calculating Bloom filter in go -
go-adaptive-radix-tree
Adaptive Radix Trees implemented in Go -
goconcurrentqueue
Go concurrent-safe, goroutine-safe, thread-safe queue -
cuckoo-filter
Cuckoo Filter go implement, better than Bloom Filter, configurable and space optimized 布谷鸟过滤器的Go实现,优于布隆过滤器,可以定制化过滤器参数,并进行了空间优化 -
ring
Package ring provides a high performance and thread safe Go implementation of a bloom filter. -
go-rquad
:pushpin: State of the art point location and neighbour finding algorithms for region quadtrees, in Go -
set
A simple Set data structure implementation in Go (Golang) using LinkedHashMap. -
goset
Set is a useful collection but there is no built-in implementation in Go lang. -
nan
Zero allocation Nullable structures in one library with handy conversion functions, marshallers and unmarshallers -
hide
ID type with marshalling to/from hash to prevent sending IDs to clients.
Build time-series-based applications quickly and at scale.
InfluxDB is the Time Series Platform where developers build real-time applications for analytics, IoT and cloud-native services. Easy to start, it is available in the cloud or on-premises.
Promo
www.influxdata.com
Do you think we are missing an alternative of algorithms or a related project?
README
algorithms
CLRS study. Codes are written with golang.
go version: 1.11
-
- binaryTree
- BST
- RedBlackTree
- B-Tree
- RS-vEB-Tree(Support single key multi value.Lazy hashtable is used to instead of array to reduce space complexity.Including Go Mixin design pattern)
- Disjoint-Set-Tree
Graph (including linkedMap, iterator)
- graph
- BFS
- DFS(use stack)
- StronglyConnectedComponents
- BioConnectedComponents(vertex bcc & edge bcc, use stack)
- eulerCircuit
- mst(including Kruskal(disjointSet) , Prim(fibonacci heap), secondaryMst, mst reduce for Prim, linear time bottleneck spanning tree)
- Single-Source Shortest Path (including bellmanFord, SPFA, Dijkstra, Gabow )
- All-Pairs Shortest Path (including FloydWarshall, Johnson)
- Max Flow (including flowGraph , preFlowGraph and allowedGraph data structure, Edmondes Karp, Push Relabel, Relabel to Front, Bipartite Graph Max Match and Hopcraft-Karp)
HashMap(Support UpScale and DownScale)
DynamicProgramming (Including OOP pattern of golang)