Algorithms and Data Structures implemented in Go for beginners, following best practices.
- algorithms
- algorithms-implemented
- data-structures
- datastructures
47,133 repositories indexed
1–18 of 18 · Most stars
Algorithms and Data Structures implemented in Go for beginners, following best practices.
GoDS (Go Data Structures) - Sets, Lists, Stacks, Maps, Trees, Queues, and much more
Universally Unique Lexicographically Sortable Identifier (ULID) in Go
A simple, fast, embeddable, persistent key/value store written in pure Go. It supports fully serializable transactions and many data structures such as list, set, sorted set.
Simple command-line utility to convert CSV, TSV and Excel files into a single self-contained HTML page with search, filters, and sorting
Data structure and algorithm library for go, designed to provide functions similar to C++ STL
CLRS study. Codes are written with golang.
Right imports sorting & code formatting tool (goimports alternative)
Stream api (kind of) implementation for go, other useful functions and packages to use go in a functional way
Neovim edit completion plugin
A fast string sorting algorithm (MSD radix sort)
Arch Linux AUR Helper with ncurses functionality and better searching and sorting
:zap: Fast Concurrent / Parallel Sorting in Go
Generic graph data structures and algorithms for Go (Golang): dependency graphs (DAGs) with cycle checks and topological sort, BFS and DFS traversal, Dijkstra and other shortest paths, connectivity and partitioning. No dependencies.
Compact, sortable and fast unique IDs with embedded metadata.
Generic sorted map for Go with red-black tree under the hood
map library using Go generics that offers a standard interface, go routine synchronization, and sorting
Topological sort lib,Sorting and pruning of DAG graphs.