A monorepo contains some of common algorithms and data structures written in Typescript.
| Package | Description |
|---|---|
| @algorithm.ts/binary-index-tree | Binary Index Tree. |
| @algorithm.ts/circular-queue | Circular queue. |
| @algorithm.ts/dijkstra | Dijkstra algorithm optimized with @algorithm.ts/priority-queue. #ShortestPath. |
| @algorithm.ts/dinic | Dinic algorithm. #MaxFlow, #NetworkFlow. |
| @algorithm.ts/dlx | DLX algorithm. |
| @algorithm.ts/findset | Find set. |
| @algorithm.ts/gcd | Greatest Common Divisor (GCD) and extended Euclidean algorithm. |
| @algorithm.ts/isap | ISAP algorithm. #MaxFlow, #NetworkFlow. |
| @algorithm.ts/knuth-shuffle | Knuth-Shuffle algorithm. |
| @algorithm.ts/lower-bound | Find the index of first elements which greater or equals than the target element. |
| @algorithm.ts/mcmf | MCMF algorithm. #MinCostMaxFlow, #NetworkFlow. |
| @algorithm.ts/priority-queue | Priority Queue (heap). |
| @algorithm.ts/sliding-window | Sliding window algorithm. |
| @algorithm.ts/sudoku | A collection of utilities to generate / solve Sudoku problems. |
| @algorithm.ts/trie | Trie. (digital tree or prefix tree) |
| @algorithm.ts/upper-bound | Find the index of first elements which greater than the target element. |
algorithm.ts is MIT licensed.