JS data structs

A small data structures and algorithms library for JavaScript.

Installing

NPM package

npm i js-data-structs

NPM page

CDN

https://cdn.jsdelivr.net/npm/js-data-structs@latest/dist/js-data-structs.umd.js

jsDeliver

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 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

Future features

Expand

• Minified version

• Linked List

  • Circular Linked List
  • Doubly Linked List

• Heapsort

  • Max heap
  • Min heap

• Suffix trees

• More Graph algorithms

  • Topological Sort
  • Dijkstra's Algorithm

• LZW

  • Encoding
  • Decoding