GoDS (Go Data Structures) - Sets, Lists, Stacks, Maps, Trees, Queues, and much more
-
Updated
Mar 12, 2025 - Go
A data structure is a particular way storing and organizing data in a computer for efficient access and modification. Data structures are designed for a specific purpose. Examples include arrays, linked lists, and classes.
GoDS (Go Data Structures) - Sets, Lists, Stacks, Maps, Trees, Queues, and much more
算法竞赛模板库 by 灵茶山艾府 💭💡🎈
A generic patricia trie (also called radix tree) implemented in Go (Golang)
A DAG, Directed acyclic graph implementation in golang.
Simple and high-performance data structures and algorithms library
List data structure supporting prefix sums
Succinct Data Structure of Trie, written in Go
Generic data structure using parameterized types in Golang.
[DEPRECATED] (Use https://github.com/golang-ds)
Algorithms and Data Structure For Go Applications
ZSet is an in-memory Redis like sorted set datastructure
Structure of Arrays for Go
Go & java languages learning, including common algorithm, data-structure, design-patterns
Data-Structure implementation in Go
A simplified quad-tree server. Good for prototyping.
Type-safe sets for Go (pre-generics)