data-structure-typed/README.md

Data Structure Typed

Data Structures of Javascript & TypeScript.

Do you envy C++ with STL, Python with collections, and Java with java.util ? Well, no need to envy anymore! JavaScript and TypeScript now have data-structure-typed.

Now you can use this library in Node.js and browser environments in CommonJS(require export.modules = ), ESModule(import export), Typescript(import export), UMD(var Queue = dataStructureTyped.Queue)

Built-in classic algorithms

DFS(Depth-First Search), DFSIterative, BFS(Breadth-First Search), morris, Bellman-Ford Algorithm, Dijkstra's Algorithm, Floyd-Warshall Algorithm, Tarjan's Algorithm.

Installation and Usage

npm

npm i data-structure-typed --save

yarn

yarn add data-structure-typed

import {
  BinaryTree, Graph, Queue, Stack, PriorityQueue, BST, Trie, DoublyLinkedList,
  AVLTree, MinHeap, SinglyLinkedList, DirectedGraph, TreeMultiset,
  DirectedVertex, AVLTreeNode
} from 'data-structure-typed';

CDN

<script src='https://cdn.jsdelivr.net/npm/data-structure-typed/dist/umd/data-structure-typed.min.js'></script>

const {Heap} = dataStructureTyped;
const {
  BinaryTree, Graph, Queue, Stack, PriorityQueue, BST, Trie, DoublyLinkedList,
  AVLTree, MinHeap, SinglyLinkedList, DirectedGraph, TreeMultiset,
  DirectedVertex, AVLTreeNode
} = dataStructureTyped;

API docs & Examples

API Docs

Live Examples

Examples Repository

Code Snippet

Binary Search Tree (BST) snippet

TS

import {BST, BSTNode} from 'data-structure-typed';

const bst = new BST();
bst.add(11);
bst.add(3);
bst.addMany([15, 1, 8, 13, 16, 2, 6, 9, 12, 14, 4, 7, 10, 5]);
bst.size === 16;                // true
bst.has(6);                     // true
const node6 = bst.get(6);       // BSTNode
bst.getHeight(6) === 2;         // true
bst.getHeight() === 5;          // true
bst.getDepth(6) === 3;          // true

bst.getLeftMost()?.id === 1;    // true

bst.delete(6);
bst.get(6);                     // null
bst.isAVLBalanced();            // true
bst.bfs()[0] === 11;            // true

const objBST = new BST<BSTNode<{id: number, keyA: number}>>();
objBST.add(11, {id: 11, keyA: 11});
objBST.add(3, {id: 3, keyA: 3});

objBST.addMany([{id: 15, keyA: 15}, {id: 1, keyA: 1}, {id: 8, keyA: 8},
  {id: 13, keyA: 13}, {id: 16, keyA: 16}, {id: 2, keyA: 2},
  {id: 6, keyA: 6}, {id: 9, keyA: 9}, {id: 12, keyA: 12},
  {id: 14, keyA: 14}, {id: 4, keyA: 4}, {id: 7, keyA: 7},
  {id: 10, keyA: 10}, {id: 5, keyA: 5}]);

objBST.delete(11);

JS

const {BST, BSTNode} = require('data-structure-typed');

const bst = new BST();
bst.add(11);
bst.add(3);
bst.addMany([15, 1, 8, 13, 16, 2, 6, 9, 12, 14, 4, 7, 10, 5]);
bst.size === 16;        // true
bst.has(6);             // true
const node6 = bst.get(6);
bst.getHeight(6) === 2; // true
bst.getHeight() === 5;  // true
bst.getDepth(6) === 3;  // true
const leftMost = bst.getLeftMost();
leftMost?.id === 1;     // true
expect(leftMost?.id).toBe(1);
bst.delete(6);
bst.get(6);             // null
bst.isAVLBalanced();    // true or false
const bfsIDs = bst.bfs();
bfsIDs[0] === 11;       // true
expect(bfsIDs[0]).toBe(11);

const objBST = new BST();
objBST.add(11, {id: 11, keyA: 11});
objBST.add(3, {id: 3, keyA: 3});

objBST.addMany([{id: 15, keyA: 15}, {id: 1, keyA: 1}, {id: 8, keyA: 8},
  {id: 13, keyA: 13}, {id: 16, keyA: 16}, {id: 2, keyA: 2},
  {id: 6, keyA: 6}, {id: 9, keyA: 9}, {id: 12, keyA: 12},
  {id: 14, keyA: 14}, {id: 4, keyA: 4}, {id: 7, keyA: 7},
  {id: 10, keyA: 10}, {id: 5, keyA: 5}]);

objBST.delete(11);

const avlTree = new AVLTree();
avlTree.addMany([11, 3, 15, 1, 8, 13, 16, 2, 6, 9, 12, 14, 4, 7, 10, 5])
avlTree.isAVLBalanced();    // true
avlTree.delete(10);
avlTree.isAVLBalanced();    // true

AVLTree snippet

TS

import {AVLTree} from 'data-structure-typed';

const avlTree = new AVLTree();
avlTree.addMany([11, 3, 15, 1, 8, 13, 16, 2, 6, 9, 12, 14, 4, 7, 10, 5])
avlTree.isAVLBalanced();    // true
avlTree.delete(10);
avlTree.isAVLBalanced();    // true

JS

const {AVLTree} = require('data-structure-typed');

const avlTree = new AVLTree();
avlTree.addMany([11, 3, 15, 1, 8, 13, 16, 2, 6, 9, 12, 14, 4, 7, 10, 5])
avlTree.isAVLBalanced();    // true
avlTree.delete(10);
avlTree.isAVLBalanced();    // true

Directed Graph simple snippet

TS or JS

import {DirectedGraph} from 'data-structure-typed';

const graph = new DirectedGraph();

graph.addVertex('A');
graph.addVertex('B');

graph.hasVertex('A');       // true
graph.hasVertex('B');       // true
graph.hasVertex('C');       // false

graph.addEdge('A', 'B');
graph.hasEdge('A', 'B');    // true
graph.hasEdge('B', 'A');    // false

graph.deleteEdgeSrcToDest('A', 'B');
graph.hasEdge('A', 'B');    // false

graph.addVertex('C');

graph.addEdge('A', 'B');
graph.addEdge('B', 'C');

const topologicalOrderIds = graph.topologicalSort(); // ['A', 'B', 'C']

Undirected Graph snippet

TS or JS

import {UndirectedGraph} from 'data-structure-typed';

const graph = new UndirectedGraph();
graph.addVertex('A');
graph.addVertex('B');
graph.addVertex('C');
graph.addVertex('D');
graph.deleteVertex('C');
graph.addEdge('A', 'B');
graph.addEdge('B', 'D');

const dijkstraResult = graph.dijkstra('A');
Array.from(dijkstraResult?.seen ?? []).map(vertex => vertex.id) // ['A', 'B', 'D']

Data Structures

Data Structure	Unit Test	Performance Test	API Documentation	Implemented
Binary Tree			Binary Tree
Binary Search Tree (BST)			BST
AVL Tree			AVLTree
Tree Multiset			TreeMultiset
Segment Tree			SegmentTree
Binary Indexed Tree			BinaryIndexedTree
Graph			AbstractGraph
Directed Graph			DirectedGraph
Undirected Graph			UndirectedGraph
Linked List			SinglyLinkedList
Singly Linked List			SinglyLinkedList
Doubly Linked List			DoublyLinkedList
Queue			Queue
Object Deque			ObjectDeque
Array Deque			ArrayDeque
Stack			Stack
Coordinate Set			CoordinateSet
Coordinate Map			CoordinateMap
Heap			Heap
Priority Queue			PriorityQueue
Max Priority Queue			MaxPriorityQueue
Min Priority Queue			MinPriorityQueue
Trie			Trie

Standard library data structure comparison

Data Structure	Data Structure Typed	C++ STL	java.util	Python collections
Dynamic Array	Array<E>	vector<T>	ArrayList<E>	list
Linked List	DoublyLinkedList<E>	list<T>	LinkedList<E>	deque
Singly Linked List	SinglyLinkedList<E>	-	-	-
Set	Set<E>	set<T>	HashSet<E>	set
Map	Map<K, V>	map<K, V>	HashMap<K, V>	dict
Ordered Dictionary	Map<K, V>	-	-	OrderedDict
Queue	Queue<E>	queue<T>	Queue<E>	-
Priority Queue	PriorityQueue<E>	priority_queue<T>	PriorityQueue<E>	-
Heap	Heap<V>	priority_queue<T>	PriorityQueue<E>	heapq
Stack	Stack<E>	stack<T>	Stack<E>	-
Deque	Deque<E>	deque<T>	-	-
Trie	Trie	-	-	-
Unordered Map	HashMap<K, V>	unordered_map<K, V>	HashMap<K, V>	defaultdict
Multiset	-	multiset<T>	-	-
Multimap	-	multimap<K, V>	-	-
Binary Tree	BinaryTree<K, V>	-	-	-
Binary Search Tree	BST<K, V>	-	-	-
Directed Graph	DirectedGraph<V, E>	-	-	-
Undirected Graph	UndirectedGraph<V, E>	-	-	-
Unordered Multiset	-	unordered_multiset	-	Counter
Linked Hash Set	-	-	LinkedHashSet<E>	-
Linked Hash Map	-	-	LinkedHashMap<K, V>	-
Sorted Set	AVLTree<E>	-	TreeSet<E>	-
Sorted Map	AVLTree<K, V>	-	TreeMap<K, V>	-
Tree Set	AVLTree<E>	set	TreeSet<E>	-
Unordered Multimap	-	unordered_multimap<K, V>	-	-
Bitset	-	bitset<N>	-	-
Unordered Set	-	unordered_set<T>	HashSet<E>	-

Code design

Adhere to ES6 standard naming conventions for APIs.

Standardize API conventions by using 'add' and 'delete' for element manipulation methods in all data structures.

Opt for concise and clear method names, avoiding excessive length while ensuring explicit intent.

Object-oriented programming(OOP)

By strictly adhering to object-oriented design (BinaryTree -> BST -> AVLTree -> TreeMultiset), you can seamlessly inherit the existing data structures to implement the customized ones you need. Object-oriented design stands as the optimal approach to data structure design.

Benchmark

avl-tree

test name	time taken (ms)	executions per sec	sample deviation
10,000 add randomly	32.75	30.53	9.04e-4
10,000 add & delete randomly	69.59	14.37	0.00
10,000 addMany	42.07	23.77	8.58e-4
10,000 get	27.87	35.88	5.71e-4

binary-tree

test name	time taken (ms)	executions per sec	sample deviation
1,000 add randomly	12.84	77.86	1.92e-4
1,000 add & delete randomly	15.94	62.72	3.07e-4
1,000 addMany	10.59	94.45	1.67e-4
1,000 get	17.99	55.59	2.35e-4
1,000 dfs	70.17	14.25	8.83e-4
1,000 bfs	54.52	18.34	7.43e-4
1,000 morris	37.26	26.84	5.27e-4

bst

test name	time taken (ms)	executions per sec	sample deviation
10,000 add randomly	33.25	30.07	4.20e-4
10,000 add & delete randomly	73.76	13.56	8.39e-4
10,000 addMany	29.96	33.38	4.40e-4
10,000 get	28.53	35.05	3.89e-4

rb-tree

test name	time taken (ms)	executions per sec	sample deviation
100,000 add randomly	74.41	13.44	0.00
100,000 add & 1000 delete randomly	80.63	12.40	0.01
100,000 getNode	60.00	16.67	0.01

directed-graph

test name	time taken (ms)	executions per sec	sample deviation
1,000 addVertex	0.10	9856.40	1.79e-6
1,000 addEdge	6.21	160.96	8.40e-4
1,000 getVertex	0.05	2.16e+4	3.85e-7
1,000 getEdge	22.43	44.57	0.00
tarjan	219.40	4.56	0.03
tarjan all	214.21	4.67	0.00
topologicalSort	172.46	5.80	0.00

heap

test name	time taken (ms)	executions per sec	sample deviation
10,000 add & pop	4.63	215.75	4.05e-5
10,000 fib add & pop	355.10	2.82	0.00

doubly-linked-list

test name	time taken (ms)	executions per sec	sample deviation
1,000,000 unshift	210.62	4.75	0.05
1,000,000 unshift & shift	176.63	5.66	0.04
1,000,000 insertBefore	288.55	3.47	0.05

singly-linked-list

test name	time taken (ms)	executions per sec	sample deviation
10,000 push & pop	232.24	4.31	0.03
10,000 insertBefore	245.58	4.07	0.00

max-priority-queue

test name	time taken (ms)	executions per sec	sample deviation
10,000 refill & poll	11.62	86.09	2.24e-4

deque

test name	time taken (ms)	executions per sec	sample deviation
1,000,000 push	223.78	4.47	0.05
1,000,000 shift	25.79	38.78	0.00

queue

test name	time taken (ms)	executions per sec	sample deviation
1,000,000 push	44.27	22.59	0.01
1,000,000 push & shift	79.63	12.56	0.00

trie

test name	time taken (ms)	executions per sec	sample deviation
100,000 push	49.29	20.29	0.00
100,000 getWords	95.55	10.47	0.01