https://github.com/sombertm/ts-dsa
Various Data Structures & Algorithms implemented in TypeScript with a strong focus on typings and extensibility
https://github.com/sombertm/ts-dsa
algorithms data-structures types typescript
Last synced: about 1 year ago
JSON representation
Various Data Structures & Algorithms implemented in TypeScript with a strong focus on typings and extensibility
- Host: GitHub
- URL: https://github.com/sombertm/ts-dsa
- Owner: SomberTM
- Created: 2023-11-17T01:38:31.000Z (over 2 years ago)
- Default Branch: main
- Last Pushed: 2023-12-18T22:43:03.000Z (over 2 years ago)
- Last Synced: 2025-01-11T02:51:41.911Z (about 1 year ago)
- Topics: algorithms, data-structures, types, typescript
- Language: TypeScript
- Homepage:
- Size: 214 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# ts-dsa
Various Data Structures & Algorithms implemented in TypeScript
## Data Structures
- [x] Graph (Directed & Undirected)
- Trees
- [ ] Basic Tree (n children)
- [ ] Binary Tree
- [ ] 2-3 Tree
- [ ] Red Black Tree
- [ ] LLRB Tree
- [ ] AVL Tree
- [ ] Splay Tree
- Heap
- [x] Min/Max Binary Heap
- [ ] Fibonnaci Heap
- [x] Priority Queue
- [x] Stack
- [x] Queue
- [ ] Dequeue
- Linked Lists
- [x] Singly
- [x] Doubly
- [ ] UnionFind (Disjoint-Sets)
## Algorithms
- [x] BFS
- [x] DFS
- Tree Traversals
- [ ] Inorder
- [ ] Preorder
- [ ] Postorder
- [ ] Topological Sort
- Minimum Spanning Tree Algorithms
- [ ] Prims
- [ ] Kruskals
- Path Finding
- [x] Dijkstras
- [ ] Bellman-Ford
- [ ] A\* (Maybe)
- [ ] Floyd-Warshall / AllPairs
- Strongly Connected Components
- [ ] Kosarajus
- Sorting
- [ ] Bubble
- [ ] Insertion
- [ ] Selection
- [ ] Merge
- [ ] Heapsort
- [ ] Quicksort
- [ ] Shell Sort
- Special Sorting:
- [ ] Counting
- [ ] Bucket
- [ ] Radix