Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/aveek-saha/js-data-structs
A small data structures library for JavaScript
https://github.com/aveek-saha/js-data-structs
algorithm algorithms binary-search-tree binary-trees data-structures fisher-yates-shuffle graph graphs hacktoberfest heap-sort javascript lzw-compression queue stack tree trie-structure
Last synced: 8 days ago
JSON representation
A small data structures library for JavaScript
- Host: GitHub
- URL: https://github.com/aveek-saha/js-data-structs
- Owner: Aveek-Saha
- License: mit
- Created: 2018-12-07T02:47:11.000Z (almost 6 years ago)
- Default Branch: master
- Last Pushed: 2022-03-14T15:53:42.000Z (over 2 years ago)
- Last Synced: 2024-10-03T00:13:52.413Z (about 1 month ago)
- Topics: algorithm, algorithms, binary-search-tree, binary-trees, data-structures, fisher-yates-shuffle, graph, graphs, hacktoberfest, heap-sort, javascript, lzw-compression, queue, stack, tree, trie-structure
- Language: JavaScript
- Homepage: https://data-structs.netlify.com/
- Size: 253 KB
- Stars: 6
- Watchers: 2
- Forks: 1
- Open Issues: 2
-
Metadata Files:
- Readme: README.md
- Contributing: CONTRIBUTING.md
- Funding: .github/FUNDING.yml
- License: LICENSE
- Code of conduct: CODE_OF_CONDUCT.md
Awesome Lists containing this project
README
JS data structs
A small data structures and algorithms library for JavaScript.
## Installing
### NPM package
```
npm i js-data-structs
```
[**NPM page**](https://www.npmjs.com/package/js-data-structs)
### CDN
```
https://cdn.jsdelivr.net/npm/js-data-structs@latest/dist/js-data-structs.umd.js
```
[**jsDeliver**](https://www.jsdelivr.com/package/npm/js-data-structs)
## Implemented Data structures/ Algos-
Expand
- Trees
- Binary Trees
- Binary Search Trees
- Stack
- Queue
- Priority Queue
- Graph
- BFS
- DFS
- Topological Sort
- Dijkstra's Algorithm
- Trie
- Power set
- Heap's algorithm (array permutations)
- Linked List
- Doubly Linked List
- Heap Sort
- Max heap
- Min heap
- Z algorithm (pattern matching)
- N Queens
- LZW
- Encoding
- Decoding
- Fisher–Yates shuffle Algorithm
- Binary Search
- Rabin Karp
- Levenshtein Distance
# Contributing
Before contributing please read [CONTRIBUTING.md](https://github.com/Aveek-Saha/js-data-structs/blob/master/CONTRIBUTING.md) for guidelines.
In addition to the guidelines mentioned in `CONTRIBUTING.md` there are some additional things to keep in mind while raising pull requests. Before your pull request can be accepted there are some checks that have to pass. To run these checks locally-
- `npm run prepare` to compile with Rollup and Babel
- `npm run format` to format with Prettier
- `npm run lint` to check for linting errors
- `npm test` to run the Jest unit tests
New algorithms or data structures are added to `./src/` and you also have to add test cases for all functions implemented in the `./test/` folder.
### [Usage guide](https://data-structs.netlify.com/guide/trees.html)
# Future features
Expand
- [x] Minified version
- [x] Linked List
- [ ] Circular Linked List
- [x] Doubly Linked List
- [x] Heapsort
- [x] Max heap
- [x] Min heap
- [ ] Suffix trees
- [ ] More Graph algorithms
- [x] Topological Sort
- [x] Dijkstra's Algorithm
- [x] LZW
- [x] Encoding
- [x] Decoding