Popularity
7.1
Declining
Activity
0.0
Stable
815
25
121
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.
-
golang-set
A simple, battle-tested and generic set type for the Go language. Trusted by Docker, 1Password, Ethereum and Hashicorp. -
hyperloglog
HyperLogLog with lots of sugar (Sparse, LogLog-Beta bias correction and TailCut space reduction) brought to you by Axiom -
ttlcache
DISCONTINUED. An in-memory cache with item expiration and generics [Moved to: https://github.com/jellydator/ttlcache] -
Bloomfilter
DISCONTINUED. Face-meltingly fast, thread-safe, marshalable, unionable, probability- and optimal-size-calculating Bloom filter in go -
hilbert
DISCONTINUED. Go package for mapping values to and from space-filling curves, such as Hilbert and Peano curves. -
cuckoo-filter
Cuckoo Filter go implement, better than Bloom Filter, configurable and space optimized 布谷鸟过滤器的Go实现,优于布隆过滤器,可以定制化过滤器参数,并进行了空间优化 -
go-rquad
:pushpin: State of the art point location and neighbour finding algorithms for region quadtrees, in Go -
nan
Zero allocation Nullable structures in one library with handy conversion functions, marshallers and unmarshallers -
hide
A Go type to prevent internal numeric IDs from being exposed to clients using HashIDs and JSON.
CodeRabbit: AI Code Reviews for Developers
Revolutionize your code reviews with AI. CodeRabbit offers PR summaries, code walkthroughs, 1-click suggestions, and AST-based analysis. Boost productivity and code quality across all major languages with each PR.
Promo
coderabbit.ai

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)