JSPM

  • Created
  • Published
  • Downloads 15516
  • Score
    100M100P100Q145922F
  • License ISC

Explore our comprehensive Javascript Data Structure / TypeScript Data Structure Library, meticulously crafted to empower developers with a versatile set of essential data structures. Our library includes a wide range of data structures, such as Binary Tree, AVL Tree, Binary Search Tree (BST), Tree Multiset, Segment Tree, Binary Indexed Tree, Graph, Directed Graph, Undirected Graph, Singly Linked List, Hash, CoordinateSet, CoordinateMap, Heap, Doubly Linked List, Priority Queue, Max Priority Queue, Min Priority Queue, Queue, ObjectDeque, ArrayDeque, Stack, and Trie. Each data structure is thoughtfully designed and implemented using TypeScript to provide efficient, reliable, and easy-to-use solutions for your programming needs. Whether you're optimizing algorithms, managing data, or enhancing performance, our TypeScript Data Structure Library is your go-to resource. Elevate your coding experience with these fundamental building blocks for software development.

Package Exports

  • data-structure-typed
  • data-structure-typed/dist/index.js

This package does not declare an exports field, so the exports above have been automatically detected and optimized by JSPM instead. If any package subpath is missing, it is recommended to post an issue to the original package (data-structure-typed) to support the "exports" field. If that is not possible, create a JSPM override to customize the exports field for this package.

Readme

data-structure-typed

Javascript Data Structure, TypeScript Data Structure Library

install

yarn

yarn add data-structure-typed

npm

npm install data-structure-typed

api docs

data structures

Meticulously crafted to empower developers with a versatile set of essential data structures. Our library includes a wide range of data structures: Binary Tree, Binary Search Tree (BST), AVL Tree, Tree Multiset, Segment Tree, Binary Indexed Tree, Graph, Directed Graph, Undirected Graph, Linked List, Singly Linked List, Doubly Linked List, Queue, Object Deque, Array Deque, Stack, Hash, Coordinate Set, Coordinate Map, Heap, Priority Queue, Max Priority Queue, Min Priority Queue, Trie

Data Structure Derived Basic Features Additional Features
Binary Tree AVL Tree, Binary Search Tree, Tree Multiset put, has, get, remove, size, insertTo, insertMany, fill, getDepth, getHeight, getMinHeight, getPathToRoot, isBalanced getLeftMost, isBST, getSubTreeSizeAndCount, subTreeSum, subTreeAdd, BFS, DFS, DFSIterative, levelIterative, listLevels, getPredecessor, morris,
AVL Tree All the features inherited from Binary Tree, balanceFactor, updateHeight, balancePath, balanceLL, balanceLR, balanceRR, balanceRL
Binary Search Tree (BST) All the features inherited from Binary Tree, lastKey All the features inherited from Binary Tree, lesserSum, allGreaterNodesAdd, balance, isAVLBalanced
Tree Multiset All the features inherited from Binary Tree All the features inherited from Binary Tree
Segment Tree build, updateNode, querySumByRange
Binary Indexed Tree update, getPrefixSum, getRangeSum, BinaryIndexedTree.lowBit
Graph Directed Graph, Undirected Graph getVertex, getVertexId, containsVertex, vertexSet, addVertex, removeVertex, removeAllVertices, containsEdge, setEdgeWeight, getAllPathsBetween, getPathSumWeight, getMinCostBetween, getMinPathBetween, dijkstra, dijkstraWithoutHeap, bellmanFord, floyd, tarjan
Directed Graph All the features inherited from Graph, getEdge, addEdge, removeEdgeBetween, removeEdge, removeAllEdges, incomingEdgesOf, outgoingEdgesOf, degreeOf, inDegreeOf, outDegreeOf, edgesOf, getEdgeSrc, getEdgeDest, getDestinations, edgeSet, getNeighbors, getEndsOfEdge All the features inherited from Graph, topologicalSort
Undirected Graph All the features inherited from Graph, getEdge, addEdge, removeEdgeBetween, removeEdge, degreeOf, edgesOf, edgeSet, getEdgesOf, getNeighbors, getEndsOfEdge All the features inherited from Graph
Singly Linked List length, head, tail, size, get, getNode, findNodeIndex, findNode, find, findIndex, append, push, prepend, insertAt, removeNode, removeAt, insertBefore, sort, insertAfter, shift, pop, merge, clear, slice, reverse, forEach, map, filter, reduce, toArray, toString
Hash CoordinateSet, CoordinateMap
CoordinateSet has, set, get, delete
CoordinateMap has, add, delete
Heap
Doubly Linked List size, offerFirst, offerLast, peekFirst, peekLast, pollFirst, pollLast, get, isEmpty, insert, remove,
Priority Queue Max Priority Queue, Min Priority Queue offer, peek, poll, leaf, isEmpty, clear, toArray, clone isValid, sort, DFS
Max Priority Queue All the features inherited from Priority Queue All the features inherited from Priority Queue
Min Priority Queue All the features inherited from Priority Queue All the features inherited from Priority Queue
Queue Queue, Dequeue offer, poll, peek, peekLast, size, isEmpty, toArray, clear, clone, Queue.fromArray
ObjectDeque size, offerFirst, offerLast, pollFirst, peekFirst, pollLast, peekLast, get, isEmpty
ArrayDeque offerLast, pollLast, pollFirst, offerFirst, peekFirst, peekLast, get, set, insert, remove, isEmpty
Stack isEmpty, size, peek, push, pop, toArray, clear, clone, Stack.fromArray
Trie put, has, remove, isAbsPrefix, isPrefix, getAll

complexities

complexities of data structures