trieTrie (a.k.a. prefix tree) C# implementation. Has constant-time string prefix lookup.
Stars: ✭ 84 (+189.66%)
DenormalizrDenormalize data normalized with normalizr
Stars: ✭ 231 (+696.55%)
AlgorithmsJava implementation for Introduction to Algorithms book.
Stars: ✭ 58 (+100%)
BinarytreePython Library for Studying Binary Trees
Stars: ✭ 1,694 (+5741.38%)
astarixAStarix: Fast and Optimal Sequence-to-Graph Aligner
Stars: ✭ 60 (+106.9%)
lua-graphGraph algorithms in lua
Stars: ✭ 57 (+96.55%)
gmapheterogenous Map over a GADT
Stars: ✭ 40 (+37.93%)
Leetcode Solutions🏋️ Python / Modern C++ Solutions of All 2111 LeetCode Problems (Weekly Update)
Stars: ✭ 2,787 (+9510.34%)
hypergraphHypergraph is data structure library to create a directed hypergraph in which a hyperedge can join any number of vertices.
Stars: ✭ 205 (+606.9%)
dijkstrajsA simple JavaScript implementation of Dijkstra's single-source shortest-paths algorithm.
Stars: ✭ 31 (+6.9%)
algorithmsAlgorithms in python and C
Stars: ✭ 71 (+144.83%)
Go PatriciaA generic patricia trie (also called radix tree) implemented in Go (Golang)
Stars: ✭ 243 (+737.93%)
dodgrDistances on Directed Graphs in R
Stars: ✭ 106 (+265.52%)
LeetcodeHigh-quality LeetCode solutions
Stars: ✭ 178 (+513.79%)
CS basicsMy CS learning : algorithm, data structure, and system design | #SE
Stars: ✭ 21 (-27.59%)
Data structures and algorithms in python📖 Worked Solutions of "Data Structures & Algorithms in Python", written by Michael T. Goodrich, Roberto Tamassia and Michael H. Goldwasser. ✏️
Stars: ✭ 147 (+406.9%)
the-entitytainerA single header library for managing game entity hierarchies.
Stars: ✭ 31 (+6.9%)
MnemonistCurated collection of data structures for the JavaScript/TypeScript language.
Stars: ✭ 1,752 (+5941.38%)
FlyingCarUdacity🛩️⚙️ 3D Planning, PID Control, Extended Kalman Filter for the Udacity Flying Car Nanodegree // FCND-Term1
Stars: ✭ 16 (-44.83%)
Differentia.jsNo longer being supported or maintained. A Graph Theory & Data Structure Library for JavaScript.
Stars: ✭ 13 (-55.17%)
BplustreeA minimal but extreme fast B+ tree indexing structure demo for billions of key-value storage
Stars: ✭ 1,598 (+5410.34%)
ds🔗 Common Data Structures and Algorithms
Stars: ✭ 40 (+37.93%)
js-symbol-treeTurn any collection of objects into its own efficient tree or linked list using Symbol
Stars: ✭ 86 (+196.55%)
fixie-trieCompact tries for fixed-width keys
Stars: ✭ 23 (-20.69%)
linked-blocking-multi-queueA concurrent collection that extends the existing Java concurrent collection library, offering an optionally-bounded blocking "multi-queue" based on linked nodes.
Stars: ✭ 41 (+41.38%)
data-structure-tsBasic data structures and popular algorithms implemented in Typescript.
Stars: ✭ 14 (-51.72%)
CPTH🌟 Competitive Programming Template Headers | With documentation, CI tests and Codecov
Stars: ✭ 23 (-20.69%)
CPCompetitive Coding
Stars: ✭ 25 (-13.79%)
Advanced-Shortest-Paths-AlgorithmsJava Code for Contraction Hierarchies Algorithm, A-Star Algorithm and Bidirectional Dijkstra Algorithm. Tested and Verified Code.
Stars: ✭ 63 (+117.24%)
StaticvecImplements a fixed-capacity stack-allocated Vec alternative backed by an array, using const generics.
Stars: ✭ 236 (+713.79%)
leetcode✍️ 200+ LeetCode solutions in Java
Stars: ✭ 53 (+82.76%)
C Macro CollectionsEasy to use, header only, macro generated, generic and type-safe Data Structures in C
Stars: ✭ 192 (+562.07%)
dask-awkwardNative Dask collection for awkward arrays, and the library to use it.
Stars: ✭ 25 (-13.79%)
OrdereddictionaryOrdered dictionary data structure implementation in Swift
Stars: ✭ 176 (+506.9%)
Awesome🚠Algorithm And Data Structure
Stars: ✭ 152 (+424.14%)
array-keyed-mapJS datastructure, like Map, but the keys are arrays
Stars: ✭ 29 (+0%)
Skiplistskip list with rank, code less than z_set in redis
Stars: ✭ 136 (+368.97%)
FingerTreeA Scala implementation of the versatile purely functional data structure of the same name.
Stars: ✭ 59 (+103.45%)
playgroundA place to play programming
Stars: ✭ 21 (-27.59%)
Cs61aStructure and Interpretation of Computer Programs
Stars: ✭ 123 (+324.14%)
directed graphDart implementation of a directed graph. Provides algorithms for sorting vertices, retrieving a topological ordering or detecting cycles.
Stars: ✭ 37 (+27.59%)
sword-x-offer66 classic and common interview problems from 《剑指offer》 with multiple-method-CPP solutions, and common data structure summary, etc
Stars: ✭ 19 (-34.48%)
Programming-ReferenceOpen repository of programming topic for reverse engineering purpose.
Stars: ✭ 25 (-13.79%)
Swift-X-Algorithms🔨 Algorithms & Data Structures implemented in Swift X. `let X = 5.0`
Stars: ✭ 22 (-24.14%)
nanostackSmall middleware stack library
Stars: ✭ 39 (+34.48%)