RobustIRC - an IRC network without netsplits, implemented in Go using the Raft consensus algorithm
- go
- golang
- irc
- raft
47,133 repositories indexed
409–432 of 697 · Most stars
RobustIRC - an IRC network without netsplits, implemented in Go using the Raft consensus algorithm
The Algorand AlgoKit CLI is the one-stop shop tool for developers building on the Algorand network.
Multi primitive-to-primitive (MP2P) ICP algorithms in C++
Algolia Search integration for Magento 2 - compatible with versions from 2.3.x to 2.4.x
Algorand Golang SDK
C++ Bitmap Library https://www.partow.net/programming/bitmap/index.html
Dlang Core Library
A plugin to push to Algolia based on graphQl queries
Cheat sheet for ACM-ICPC. In memory of those good old days.
The Balanced Routing Table (BART) adapts D.E. Knuth's Allotment Routing Table (ART) algorithm to deliver comparable lookup speeds with superior update efficiency and a significantly smaller memory footprint.
Trading environnement for RL agents, backtesting and training.
Building a population of models that trade crypto and mutate iteratively
A JavaScript string-scoring and fuzzy-matching library based on the Quicksilver algorithm, designed for smart auto-complete.
A javascript port of fzy's scoring algorithm. As seen on GitHub.com!
A Library to parse natural language in pure Clojure and ClojureScript
Implementations of popular data structures and algorithms
Calculates edit distance using Damerau-Levenshtein algorithm
Fast string edit distance computation, using the Damerau-Levenshtein algorithm.
SimMetrics is a Similarity Metric Library, e.g. from edit distance's (Levenshtein, Gotoh, Jaro etc) to other metrics, (e.g Soundex, Chapman). This library support multiple .NET versions including .NET Core (NETStandard 1.x)
Exchange ML models in a trustless manner!
Learn the DSA and be Interview ready
DSP algorithms for chord detection + key estimation
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.
:pushpin: State of the art point location and neighbour finding algorithms for region quadtrees, in Go