Types and utils from solving graph problems.
Knuth shuffle
Bellman-ford algorithm.
Find the index of first elements which greater or equals than the target element.
Find the index of first elements which greater or equals than the target element.
A tiny calculator for number arithmetics such as '+-*/()'
A tiny calculator for number arithmetics such as '+-*/()'
Binary Index Tree
A linear time algorithm to sieve prime numbers and get the Euler's totient function
Circular queue in Typescript
A typescript implementation of the Linear-Sieve algorithm for prime numbers.
The algorithm to find the maximum matching of the bipartite graph.
Find the index of first elements which greater than the target element.
A linear time algorithm to sieve prime numbers
The algorithm to find the maximum matching of the bipartite graph.
Tranverse the permutation of a list.
A simple data structure to manage history through circular stack.
Typescript implementation of stacks. (circular stack and etc)
Common types for the graph
Find the longest increase subsequent.
Complete string distance and similarity algorithms package with WebAssembly and JavaScript implementations
Analyze any X (Twitter) account against the open-source recommendation algorithm. CLI tool — run npx @apoorvdarshan/xscore @username
typescript implementation of the greedy first search djikstra's shortest path algorithm, compatible with javascript projects too of course
Sanity is a real-time content infrastructure with a scalable, hosted backend featuring a Graph Oriented Query Language (GROQ), asset pipelines and fast edge caches (with updated dependencies)