From ae69def97362fd254ad9a96f183ac973a6dd33b9 Mon Sep 17 00:00:00 2001 From: Revone Date: Fri, 22 Sep 2023 11:20:33 +0800 Subject: [PATCH] [README] ready to modify --- .npmignore | 5 +- CHANGELOG.md | 2 +- README.md | 116 +++++----- docs/classes/AVLTree.html | 170 +++++++-------- docs/classes/AVLTreeNode.html | 30 +-- docs/classes/AaTree.html | 2 +- docs/classes/AbstractBinaryTree.html | 156 +++++++------- docs/classes/AbstractBinaryTreeNode.html | 42 ++-- docs/classes/AbstractEdge.html | 22 +- docs/classes/AbstractGraph.html | 72 +++---- docs/classes/AbstractVertex.html | 16 +- docs/classes/ArrayDeque.html | 28 +-- docs/classes/BST.html | 156 +++++++------- docs/classes/BSTNode.html | 30 +-- docs/classes/BTree.html | 2 +- docs/classes/BinaryIndexedTree.html | 18 +- docs/classes/BinaryTree.html | 142 ++++++------- docs/classes/BinaryTreeNode.html | 30 +-- docs/classes/Character.html | 8 +- docs/classes/CoordinateMap.html | 18 +- docs/classes/CoordinateSet.html | 16 +- docs/classes/Deque.html | 68 +++--- docs/classes/DirectedEdge.html | 30 +-- docs/classes/DirectedGraph.html | 104 ++++----- docs/classes/DirectedVertex.html | 12 +- docs/classes/DoublyLinkedList.html | 74 +++---- docs/classes/DoublyLinkedListNode.html | 22 +- docs/classes/HashTable.html | 2 +- docs/classes/Heap.html | 52 ++--- docs/classes/HeapItem.html | 16 +- docs/classes/LinkedListQueue.html | 70 +++---- docs/classes/MapEdge.html | 26 +-- docs/classes/MapGraph.html | 112 +++++----- docs/classes/MapVertex.html | 24 +-- docs/classes/Matrix2D.html | 32 +-- docs/classes/MatrixNTI2D.html | 8 +- docs/classes/MaxHeap.html | 52 ++--- docs/classes/MaxPriorityQueue.html | 68 +++--- docs/classes/MinHeap.html | 52 ++--- docs/classes/MinPriorityQueue.html | 68 +++--- docs/classes/Navigator.html | 20 +- docs/classes/ObjectDeque.html | 50 ++--- docs/classes/Pair.html | 2 +- docs/classes/PriorityQueue.html | 64 +++--- docs/classes/Queue.html | 44 ++-- docs/classes/RBTree.html | 156 +++++++------- docs/classes/RBTreeNode.html | 36 ++-- docs/classes/SegmentTree.html | 34 +-- docs/classes/SegmentTreeNode.html | 40 ++-- docs/classes/SinglyLinkedList.html | 70 +++---- docs/classes/SinglyLinkedListNode.html | 16 +- docs/classes/SkipLinkedList.html | 2 +- docs/classes/SplayTree.html | 2 +- docs/classes/Stack.html | 24 +-- docs/classes/TreeMap.html | 2 +- docs/classes/TreeMultiset.html | 198 +++++++++--------- docs/classes/TreeMultisetNode.html | 36 ++-- docs/classes/TreeNode.html | 26 +-- docs/classes/TreeSet.html | 2 +- docs/classes/Trie.html | 26 +-- docs/classes/TrieNode.html | 22 +- docs/classes/TwoThreeTree.html | 2 +- docs/classes/UndirectedEdge.html | 24 +-- docs/classes/UndirectedGraph.html | 80 +++---- docs/classes/UndirectedVertex.html | 12 +- docs/classes/Vector2D.html | 56 ++--- docs/enums/CP.html | 8 +- docs/enums/FamilyPosition.html | 16 +- docs/enums/LoopType.html | 6 +- docs/enums/RBColor.html | 6 +- docs/enums/TopologicalProperty.html | 8 +- docs/functions/arrayRemove.html | 2 +- docs/functions/isThunk.html | 2 +- docs/functions/toThunk.html | 2 +- docs/functions/trampoline.html | 2 +- docs/functions/trampolineAsync.html | 2 +- docs/functions/uuidV4.html | 2 +- docs/index.html | 21 +- docs/interfaces/IAVLTree.html | 154 +++++++------- docs/interfaces/IAbstractBinaryTree.html | 144 ++++++------- docs/interfaces/IAbstractBinaryTreeNode.html | 28 +-- docs/interfaces/IAbstractGraph.html | 30 +-- docs/interfaces/IBST.html | 154 +++++++------- docs/interfaces/IDirectedGraph.html | 46 ++-- docs/interfaces/IRBTree.html | 154 +++++++------- docs/interfaces/IUNDirectedGraph.html | 32 +-- docs/types/AVLTreeNodeNested.html | 2 +- docs/types/AVLTreeOptions.html | 2 +- docs/types/AbstractBinaryTreeNodeNested.html | 2 +- .../AbstractBinaryTreeNodeProperties.html | 2 +- .../types/AbstractBinaryTreeNodeProperty.html | 2 +- docs/types/AbstractBinaryTreeOptions.html | 2 +- docs/types/BSTComparator.html | 2 +- docs/types/BSTNodeNested.html | 2 +- docs/types/BSTOptions.html | 2 +- docs/types/BinaryTreeDeletedResult.html | 2 +- docs/types/BinaryTreeNodeId.html | 2 +- docs/types/BinaryTreeNodeNested.html | 2 +- docs/types/BinaryTreeNodePropertyName.html | 2 +- docs/types/BinaryTreeOptions.html | 2 +- docs/types/DFSOrderPattern.html | 2 +- docs/types/DijkstraResult.html | 2 +- docs/types/Direction.html | 2 +- docs/types/DummyAny.html | 2 +- docs/types/EdgeId.html | 2 +- docs/types/HeapOptions.html | 2 +- docs/types/IAVLTreeNode.html | 2 +- docs/types/IBSTNode.html | 2 +- docs/types/IBinaryTree.html | 2 +- docs/types/IBinaryTreeNode.html | 2 +- docs/types/IRBTreeNode.html | 2 +- docs/types/ITreeMultiset.html | 2 +- docs/types/ITreeMultisetNode.html | 2 +- docs/types/KeyValueObject.html | 2 +- docs/types/KeyValueObjectWithId.html | 2 +- docs/types/MapGraphCoordinate.html | 2 +- docs/types/NavigatorParams.html | 2 +- docs/types/NodeOrPropertyName.html | 2 +- docs/types/NonNumberNonObjectButDefined.html | 2 +- docs/types/ObjectWithNonNumberId.html | 2 +- docs/types/ObjectWithNumberId.html | 2 +- docs/types/ObjectWithoutId.html | 2 +- docs/types/PriorityQueueComparator.html | 2 +- docs/types/PriorityQueueDFSOrderPattern.html | 2 +- docs/types/PriorityQueueOptions.html | 2 +- docs/types/RBTreeNodeNested.html | 2 +- docs/types/RBTreeOptions.html | 2 +- docs/types/RestrictValById.html | 2 +- docs/types/SegmentTreeNodeVal.html | 2 +- docs/types/SpecifyOptional.html | 2 +- docs/types/Thunk.html | 2 +- docs/types/ToThunkFn.html | 2 +- docs/types/TopologicalStatus.html | 2 +- docs/types/TreeMultisetNodeNested.html | 2 +- docs/types/TreeMultisetOptions.html | 2 +- docs/types/TrlAsyncFn.html | 2 +- docs/types/TrlFn.html | 2 +- docs/types/Turning.html | 2 +- docs/types/VertexId.html | 2 +- docs/variables/THUNK_SYMBOL.html | 2 +- package.json | 2 +- 141 files changed, 1968 insertions(+), 1980 deletions(-) diff --git a/.npmignore b/.npmignore index e045d903..95472a30 100644 --- a/.npmignore +++ b/.npmignore @@ -1,7 +1,8 @@ .editorconfig .dependency-cruiser.js -package-lock.json -rename-clear-files.sh +.auto-changelog-template.hbs +rename_clear_files.sh +tsconfig.build.json /.idea /notes diff --git a/CHANGELOG.md b/CHANGELOG.md index 2bdf58db..f4ef62d8 100644 --- a/CHANGELOG.md +++ b/CHANGELOG.md @@ -8,7 +8,7 @@ All notable changes to this project will be documented in this file. - [Semantic Versioning](https://semver.org/spec/v2.0.0.html) - [`auto-changelog`](https://github.com/CookPete/auto-changelog) -## [v1.32.0](https://github.com/zrwusa/data-structure-typed/compare/v1.12.9...main) (upcoming) +## [v1.32.1](https://github.com/zrwusa/data-structure-typed/compare/v1.12.9...main) (upcoming) ## [v1.12.9](https://github.com/zrwusa/data-structure-typed/compare/v1.12.8...v1.12.9) (14 August 2023) diff --git a/README.md b/README.md index cba3d062..3c2eab3c 100644 --- a/README.md +++ b/README.md @@ -1,3 +1,5 @@ +# Data Structure Typed + ![License](https://img.shields.io/badge/License-MIT-blue.svg) ![Language](https://img.shields.io/github/languages/top/zrwusa/data-structure-typed) ![GitHub release (latest by date)](https://img.shields.io/github/v/release/zrwusa/data-structure-typed) @@ -19,7 +21,7 @@ DFS(Depth-First Search), DFSIterative, BFS(Breadth-First Search), morris, Bellman-Ford Algorithm, Dijkstra's Algorithm, Floyd-Warshall Algorithm, Tarjan's Algorithm. -## install +## Installation and Usage ### npm ```bash npm install data-structure-typed --save @@ -32,7 +34,7 @@ yarn add data-structure-typed ```html ``` -```javascript +```js const {AVLTree} = dataStructureTyped; const {Heap, MinHeap, SinglyLinkedList, Stack, AVLTreeNode, BST, Trie, DirectedGraph, DirectedVertex, TreeMultiset} = dataStructureTyped; ``` @@ -56,7 +58,7 @@ const {Heap, MinHeap, SinglyLinkedList, Stack, AVLTreeNode, BST, Trie, DirectedG ## Code Snippet ### Binary Search Tree (BST) snippet #### TS -```typescript +```ts import {BST, BSTNode} from 'data-structure-typed'; const bst = new BST(); @@ -91,7 +93,7 @@ const {Heap, MinHeap, SinglyLinkedList, Stack, AVLTreeNode, BST, Trie, DirectedG objBST.remove(11); ``` #### JS -```javascript +```js const {BST, BSTNode} = require('data-structure-typed'); const bst = new BST(); @@ -137,73 +139,71 @@ const {Heap, MinHeap, SinglyLinkedList, Stack, AVLTreeNode, BST, Trie, DirectedG ### AVLTree snippet #### TS -```typescript - 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.remove(10); - avlTree.isAVLBalanced(); // true - +```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.remove(10); +avlTree.isAVLBalanced(); // true ``` #### JS -```javascript - 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.remove(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.remove(10); +avlTree.isAVLBalanced(); // true ``` ### Directed Graph simple snippet #### TS or JS -```typescript +```ts 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.removeEdgeSrcToDest('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'] +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.removeEdgeSrcToDest('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 -```typescript +```ts import {UndirectedGraph} from 'data-structure-typed'; - const graph = new UndirectedGraph(); - graph.addVertex('A'); - graph.addVertex('B'); - graph.addVertex('C'); - graph.addVertex('D'); - graph.removeVertex('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'] +const graph = new UndirectedGraph(); +graph.addVertex('A'); +graph.addVertex('B'); +graph.addVertex('C'); +graph.addVertex('D'); +graph.removeVertex('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 @@ -760,8 +760,6 @@ By strictly adhering to object-oriented design (BinaryTree -> BST -> AVLTree -> -[//]: # (![overview diagram](https://github.com/zrwusa/assets/blob/master/images/data-structure-typed/assets/overview-diagram-of-data-structures.png?raw=true)) - ![complexities](https://github.com/zrwusa/assets/blob/master/images/data-structure-typed/assets/complexities-diff.jpg?raw=true) ![complexities of data structures](https://github.com/zrwusa/assets/blob/master/images/data-structure-typed/assets/data-structure-complexities.jpg?raw=true) diff --git a/docs/classes/AVLTree.html b/docs/classes/AVLTree.html index f6c6c4e4..0a0e8eb5 100644 --- a/docs/classes/AVLTree.html +++ b/docs/classes/AVLTree.html @@ -33,7 +33,7 @@

Implements

+
  • Defined in src/data-structures/binary-tree/avl-tree.ts:21
    • @@ -143,7 +143,7 @@

    Returns

    +
  • Defined in src/data-structures/binary-tree/avl-tree.ts:28

    • Properties

    @@ -151,7 +151,7 @@

    Protected_comparator: BSTComparator = ...

    +
  • Defined in src/data-structures/binary-tree/bst.ts:519

    • Accessors

    @@ -163,7 +163,7 @@

    Returns src/data-structures/binary-tree/abstract-binary-tree.ts:164

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:168

    • root

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:156

    • size

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:162

    • visitedId

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:174

    • visitedLeftSum

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:192

    • visitedNode

      @@ -213,7 +213,7 @@

      Returns src/data-structures/binary-tree/abstract-binary-tree.ts:182

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:186

    • visitedVal

      @@ -223,7 +223,7 @@

      Returns src/data-structures/binary-tree/abstract-binary-tree.ts:176

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:180

    • Methods

    @@ -239,7 +239,7 @@

    Returns numberImplementation of IAVLTree.BFS

    Inherited from BST.BFS

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:929

  • Performs a breadth-first search (BFS) on a binary tree, accumulating properties of each node based on the specified property name.

    @@ -258,7 +258,7 @@

    Returns numberImplementation of IAVLTree.BFS

    Inherited from BST.BFS

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:936

  • Performs a breadth-first search (BFS) on a binary tree, accumulating the 'val' property of each node.

    @@ -277,7 +277,7 @@

    Returns IAVLTree.BFS

    Inherited from BST.BFS

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:943

  • Performs a breadth-first search (BFS) on a binary tree, accumulating nodes themselves.

    @@ -296,7 +296,7 @@

    Returns IAVLTree.BFS

    Inherited from BST.BFS

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:950

    • DFS

  • Performs a depth-first search (DFS) traversal on a binary tree and accumulates properties of each node based on the specified property name.

    @@ -334,7 +334,7 @@

    Returns numberImplementation of IAVLTree.DFS

    Inherited from BST.DFS

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:988

  • Performs a depth-first search (DFS) traversal on a binary tree and accumulates the 'val' property of each node.

    @@ -358,7 +358,7 @@

    Returns IAVLTree.DFS

    Inherited from BST.DFS

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:996

  • Performs a depth-first search (DFS) traversal on a binary tree and accumulates nodes themselves.

    @@ -382,7 +382,7 @@

    Returns IAVLTree.DFS

    Inherited from BST.DFS

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1004

    • DFSIterative

  • Performs an iterative depth-first search (DFS) traversal on a binary tree and accumulates properties of each node based on the specified property name.

    @@ -420,7 +420,7 @@

    Returns numberImplementation of IAVLTree.DFSIterative

    Inherited from BST.DFSIterative

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1055

  • Performs an iterative depth-first search (DFS) traversal on a binary tree and accumulates the 'val' property of each node.

    @@ -444,7 +444,7 @@

    Returns IAVLTree.DFSIterative

    Inherited from BST.DFSIterative

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1063

  • Performs an iterative depth-first search (DFS) traversal on a binary tree and accumulates nodes themselves.

    @@ -468,7 +468,7 @@

    Returns IAVLTree.DFSIterative

    Inherited from BST.DFSIterative

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1071

    • Protected _accumulatedByPropertyName

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1584

    • Protected _addTo

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1438

    • Protected _balanceFactor

    +
  • Defined in src/data-structures/binary-tree/avl-tree.ts:84

    • Protected _balanceLL

    +
  • Defined in src/data-structures/binary-tree/avl-tree.ts:155

    • Protected _balanceLR

    +
  • Defined in src/data-structures/binary-tree/avl-tree.ts:185

    • Protected _balancePath

    +
  • Defined in src/data-structures/binary-tree/avl-tree.ts:112

    • Protected _balanceRL

    +
  • Defined in src/data-structures/binary-tree/avl-tree.ts:268

    • Protected _balanceRR

    +
  • Defined in src/data-structures/binary-tree/avl-tree.ts:233

    • Protected _clearResults

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1526

    • Protected _compare

    +
  • Defined in src/data-structures/binary-tree/bst.ts:529

    • Protected _getResultByPropertyName

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1615

    • Protected _pushByPropertyNameStopOrNot

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1548

    • Protected _setLoopType

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1466

    • Protected _setRoot

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1507

    • Protected _setSize

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1518

    • Protected _setVisitedId

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1474

    • Protected _setVisitedLeftSum

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1498

    • Protected _setVisitedNode

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1490

    • Protected _setVisitedVal

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1482

    • Protected _updateHeight

    +
  • Defined in src/data-structures/binary-tree/avl-tree.ts:98

    • add

    +
  • Defined in src/data-structures/binary-tree/avl-tree.ts:51

    • addMany

    +
  • Defined in src/data-structures/binary-tree/bst.ts:134

    • allGreaterNodesAdd

    +
  • Defined in src/data-structures/binary-tree/bst.ts:370

    • clear

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:227

    • createNode

    +
  • Defined in src/data-structures/binary-tree/avl-tree.ts:40

    • fill

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:345

    • get

    +
  • Defined in src/data-structures/binary-tree/bst.ts:211

    • getDepth

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:412

    • getHeight

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:430

    • getLeftMost

  • The function getLeftMost returns the leftmost node in a binary tree, starting from a specified node or the root if @@ -1205,7 +1205,7 @@

    Returns IAVLTree.getLeftMost

    Inherited from BST.getLeftMost

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:651

    • getMinHeight

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:479

    • getNodes

    +
  • Defined in src/data-structures/binary-tree/bst.ts:240

    • getPathToRoot

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:615

    • getPredecessor

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1284

    • getRightMost

  • The getRightMost function returns the rightmost node in a binary tree, either recursively or iteratively using tail @@ -1358,7 +1358,7 @@

    Returns IAVLTree.getRightMost

    Inherited from BST.getRightMost

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:705

    • getSubTreeSize

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:789

    • has

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:582

    • isAVLBalanced

    +
  • Defined in src/data-structures/binary-tree/bst.ts:475

    • isBST

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:779

    • isEmpty

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:237

    • isPerfectlyBalanced

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:529

    • isSubtreeBST

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:745

    • lastKey

    +
  • Defined in src/data-structures/binary-tree/bst.ts:223

    • lesserSum

    +
  • Defined in src/data-structures/binary-tree/bst.ts:293

    • levelIterative

  • Performs a level-order traversal on a binary tree starting from the specified node and accumulates properties of each node based on the specified property name.

    @@ -1591,7 +1591,7 @@

    Returns numberImplementation of IAVLTree.levelIterative

    Inherited from BST.levelIterative

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1138

  • Performs a level-order traversal on a binary tree starting from the specified node and accumulates the 'val' property of each node.

    @@ -1615,7 +1615,7 @@

    Returns IAVLTree.levelIterative

    Inherited from BST.levelIterative

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1146

  • Performs a level-order traversal on a binary tree starting from the specified node and accumulates nodes themselves.

    @@ -1639,7 +1639,7 @@

    Returns IAVLTree.levelIterative

    Inherited from BST.levelIterative

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1154

    • listLevels

  • Collects nodes from a binary tree by a specified property and organizes them into levels.

    @@ -1681,7 +1681,7 @@

    Returns numberImplementation of IAVLTree.listLevels

    Inherited from BST.listLevels

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1205

  • Collects nodes from a binary tree by a specified property and organizes them into levels.

    @@ -1705,7 +1705,7 @@

    Returns IAVLTree.listLevels

    Inherited from BST.listLevels

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1213

  • Collects nodes from a binary tree by a specified property and organizes them into levels.

    @@ -1729,7 +1729,7 @@

    Returns IAVLTree.listLevels

    Inherited from BST.listLevels

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1221

    • morris

  • Performs an in-order, pre-order, or post-order traversal on a binary tree using the Morris traversal algorithm and accumulates properties of each node based on the specified property name.

    @@ -1767,7 +1767,7 @@

    Returns numberImplementation of IAVLTree.morris

    Inherited from BST.morris

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1315

  • Performs an in-order, pre-order, or post-order traversal on a binary tree using the Morris traversal algorithm and accumulates the 'val' property of each node.

    @@ -1791,7 +1791,7 @@

    Returns IAVLTree.morris

    Inherited from BST.morris

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1323

  • Performs an in-order, pre-order, or post-order traversal on a binary tree using the Morris traversal algorithm and accumulates nodes themselves.

    @@ -1815,7 +1815,7 @@

    Returns IAVLTree.morris

    Inherited from BST.morris

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1331

    • perfectlyBalance

    +
  • Defined in src/data-structures/binary-tree/bst.ts:434

    • remove

    +
  • Defined in src/data-structures/binary-tree/avl-tree.ts:68

    • subTreeAdd

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:882

    • subTreeSum

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:826

    • swapLocation

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:205
    • diff --git a/docs/classes/AVLTreeNode.html b/docs/classes/AVLTreeNode.html index fd7b293c..302dfa23 100644 --- a/docs/classes/AVLTreeNode.html +++ b/docs/classes/AVLTreeNode.html @@ -35,7 +35,7 @@

    Implements

    +
  • Defined in src/data-structures/binary-tree/avl-tree.ts:12
    • @@ -79,7 +79,7 @@
    Optional Returns AVLTreeNode<T, NEIGHBOR>
    +
  • Defined in src/data-structures/binary-tree/avl-tree.ts:16

    • Accessors

    @@ -95,7 +95,7 @@

    Returns Implementation of IAVLTreeNode.familyPosition

    Inherited from BSTNode.familyPosition

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:110

    • height

  • set height(v): void
  • @@ -117,7 +117,7 @@

    Returns voidImplementation of IAVLTreeNode.height

    Inherited from BSTNode.height

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:102

    • id

  • set id(v): void
  • @@ -139,7 +139,7 @@

    Returns voidImplementation of IAVLTreeNode.id

    Inherited from BSTNode.id

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:46

    • left

  • set left(v): void
  • @@ -161,7 +161,7 @@

    Returns voidImplementation of IAVLTreeNode.left

    Inherited from BSTNode.left

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:66

    • parent

  • set parent(v): void
  • @@ -183,7 +183,7 @@

    Returns voidImplementation of IAVLTreeNode.parent

    Inherited from BSTNode.parent

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:92

    • right

  • set right(v): void
  • @@ -205,7 +205,7 @@

    Returns voidImplementation of IAVLTreeNode.right

    Inherited from BSTNode.right

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:79

    • val

  • set val(value): void
  • @@ -227,7 +227,7 @@

    Returns voidImplementation of IAVLTreeNode.val

    Inherited from BSTNode.val

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:56
    • diff --git a/docs/classes/AaTree.html b/docs/classes/AaTree.html index f5d75926..8176aa55 100644 --- a/docs/classes/AaTree.html +++ b/docs/classes/AaTree.html @@ -20,7 +20,7 @@

    Hierarchy

    • AaTree
    +
  • Defined in src/data-structures/binary-tree/aa-tree.ts:1
    • diff --git a/docs/classes/AbstractBinaryTree.html b/docs/classes/AbstractBinaryTree.html index 5c56ea82..05561952 100644 --- a/docs/classes/AbstractBinaryTree.html +++ b/docs/classes/AbstractBinaryTree.html @@ -31,7 +31,7 @@

    Implements

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:138
    • @@ -132,44 +132,44 @@
    Optional Returns AbstractBinaryTree<N>
    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:146

    • Properties

    Private _loopType

    _loopType: LoopType = LoopType.ITERATIVE
    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:166

    • Private _root

    _root: null | N = null
    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:154

    • Private _size

    _size: number = 0
    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:160

    • Private _visitedId

    _visitedId: number[] = []
    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:172

    • Private _visitedLeftSum

    _visitedLeftSum: number[] = []
    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:190

    • Private _visitedNode

    _visitedNode: N[] = []
    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:184

    • Private _visitedVal

    _visitedVal: N["val"][] = []
    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:178

    • Accessors

    @@ -180,7 +180,7 @@

    loopTypeReturns LoopType

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:168

    • root

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:156

    • size

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:162

    • visitedId

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:174

    • visitedLeftSum

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:192

    • visitedNode

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:186

    • visitedVal

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:180

    • Methods

    @@ -249,7 +249,7 @@

    Returns number

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:929

  • Performs a breadth-first search (BFS) on a binary tree, accumulating properties of each node based on the specified property name.

    @@ -267,7 +267,7 @@

    Returns number

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:936

  • Performs a breadth-first search (BFS) on a binary tree, accumulating the 'val' property of each node.

    @@ -285,7 +285,7 @@

    Returns

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:943

  • Performs a breadth-first search (BFS) on a binary tree, accumulating nodes themselves.

    @@ -303,7 +303,7 @@

    Returns

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:950

    • DFS

      @@ -316,7 +316,7 @@

      Returns number

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:980

  • Performs a depth-first search (DFS) traversal on a binary tree and accumulates properties of each node based on the specified property name.

    @@ -339,7 +339,7 @@

    Returns number

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:988

  • Performs a depth-first search (DFS) traversal on a binary tree and accumulates the 'val' property of each node.

    @@ -362,7 +362,7 @@

    Returns

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:996

  • Performs a depth-first search (DFS) traversal on a binary tree and accumulates nodes themselves.

    @@ -385,7 +385,7 @@

    Returns

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1004

    • DFSIterative

      @@ -398,7 +398,7 @@

      Returns number

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1047

  • Performs an iterative depth-first search (DFS) traversal on a binary tree and accumulates properties of each node based on the specified property name.

    @@ -421,7 +421,7 @@

    Returns number

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1055

  • Performs an iterative depth-first search (DFS) traversal on a binary tree and accumulates the 'val' property of each node.

    @@ -444,7 +444,7 @@

    Returns

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1063

  • Performs an iterative depth-first search (DFS) traversal on a binary tree and accumulates nodes themselves.

    @@ -467,7 +467,7 @@

    Returns

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1071

    • Protected _accumulatedByPropertyName

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1584

    • Protected _addTo

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1438

    • Protected _clearResults

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1526

    • Protected _getResultByPropertyName

      @@ -556,7 +556,7 @@

      Returns

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1615

    • Protected _pushByPropertyNameStopOrNot

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1548

    • Protected _setLoopType

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1466

    • Protected _setRoot

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1507

    • Protected _setSize

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1518

    • Protected _setVisitedId

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1474

    • Protected _setVisitedLeftSum

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1498

    • Protected _setVisitedNode

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1490

    • Protected _setVisitedVal

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1482

    • add

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:255

    • addMany

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:314

    • clear

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:227

    • Abstract createNode

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:196

    • fill

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:345

    • get

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:599

    • getDepth

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:412

    • getHeight

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:430

    • getLeftMost

  • The function getLeftMost returns the leftmost node in a binary tree, starting from a specified node or the root if @@ -970,7 +970,7 @@

    Returns

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:651

    • getMinHeight

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:479

    • getNodes

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:544

    • getPathToRoot

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:615

    • getPredecessor

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1284

    • getRightMost

  • The getRightMost function returns the rightmost node in a binary tree, either recursively or iteratively using tail @@ -1117,7 +1117,7 @@

    Returns

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:705

    • getSubTreeSize

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:789

    • has

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:582

    • isBST

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:779

    • isEmpty

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:237

    • isPerfectlyBalanced

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:529

    • isSubtreeBST

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:745

    • levelIterative

  • Performs a level-order traversal on a binary tree starting from the specified node and accumulates properties of each node based on the specified property name.

    @@ -1281,7 +1281,7 @@

    Returns number

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1138

  • Performs a level-order traversal on a binary tree starting from the specified node and accumulates the 'val' property of each node.

    @@ -1304,7 +1304,7 @@

    Returns

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1146

  • Performs a level-order traversal on a binary tree starting from the specified node and accumulates nodes themselves.

    @@ -1327,7 +1327,7 @@

    Returns

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1154

    • listLevels

  • Collects nodes from a binary tree by a specified property and organizes them into levels.

    @@ -1367,7 +1367,7 @@

    Returns number

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1205

  • Collects nodes from a binary tree by a specified property and organizes them into levels.

    @@ -1390,7 +1390,7 @@

    Returns

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1213

  • Collects nodes from a binary tree by a specified property and organizes them into levels.

    @@ -1413,7 +1413,7 @@

    Returns

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1221

    • morris

  • Performs an in-order, pre-order, or post-order traversal on a binary tree using the Morris traversal algorithm and accumulates properties of each node based on the specified property name.

    @@ -1449,7 +1449,7 @@

    Returns number

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1315

  • Performs an in-order, pre-order, or post-order traversal on a binary tree using the Morris traversal algorithm and accumulates the 'val' property of each node.

    @@ -1472,7 +1472,7 @@

    Returns

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1323

  • Performs an in-order, pre-order, or post-order traversal on a binary tree using the Morris traversal algorithm and accumulates nodes themselves.

    @@ -1495,7 +1495,7 @@

    Returns

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1331

    • remove

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:360

    • subTreeAdd

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:882

    • subTreeSum

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:826

    • swapLocation

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:205
    • diff --git a/docs/classes/AbstractBinaryTreeNode.html b/docs/classes/AbstractBinaryTreeNode.html index 63d91a8e..69a72bd3 100644 --- a/docs/classes/AbstractBinaryTreeNode.html +++ b/docs/classes/AbstractBinaryTreeNode.html @@ -33,7 +33,7 @@

    Implements

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:23
    • @@ -96,39 +96,39 @@
    Optional Returns AbstractBinaryTreeNode<T, NEIGHBOR>
    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:35

    • Properties

    Private _height

    _height: number = 0
    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:96

    • Private _id

    _id: number
    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:40

    • Private _left

    _left: undefined | null | NEIGHBOR
    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:60

    • Private _parent

    _parent: undefined | null | NEIGHBOR
    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:86

    • Private _right

    _right: undefined | null | NEIGHBOR
    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:73

    • Private _val

    _val: undefined | T
    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:50

    • Accessors

    @@ -143,7 +143,7 @@

    Returns

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:110

    • height

  • set height(v): void
  • @@ -163,7 +163,7 @@
    v:

    Returns void

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:102

    • id

  • set id(v): void
  • @@ -183,7 +183,7 @@
    v:

    Returns void

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:46

    • left

  • set left(v): void
  • @@ -203,7 +203,7 @@
    v:

    Returns void

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:66

    • parent

  • set parent(v): void
  • @@ -223,7 +223,7 @@
    v:

    Returns void

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:92

    • right

  • set right(v): void
  • @@ -243,7 +243,7 @@
    v:

    Returns void

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:79

    • val

  • set val(value): void
  • @@ -263,7 +263,7 @@
    value: Returns void
    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:56
    • diff --git a/docs/classes/AbstractEdge.html b/docs/classes/AbstractEdge.html index d2dd073e..2d550f52 100644 --- a/docs/classes/AbstractEdge.html +++ b/docs/classes/AbstractEdge.html @@ -28,7 +28,7 @@

    Hierarchy

  • DirectedEdge
  • UndirectedEdge
    • +
  • Defined in src/data-structures/graph/abstract-graph.ts:47
    • @@ -88,24 +88,24 @@
    Optional Returns AbstractEdge<T>
    +
  • Defined in src/data-structures/graph/abstract-graph.ts:57

    • Properties

    Protected _hashCode

    _hashCode: string
    +
  • Defined in src/data-structures/graph/abstract-graph.ts:83

    • Private _val

    _val: undefined | T
    +
  • Defined in src/data-structures/graph/abstract-graph.ts:63

    • Private _weight

    _weight: number
    +
  • Defined in src/data-structures/graph/abstract-graph.ts:73

    • Accessors

    @@ -115,7 +115,7 @@

    hashCode

    Returns string

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:85

    • val

  • set val(value): void
  • @@ -133,7 +133,7 @@

    Parameters

    value: undefined | T

    • Returns void

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:69

    • weight

  • set weight(v): void
  • @@ -151,7 +151,7 @@

    Parameters

    v: number

    • Returns void

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:79

    • Methods

    @@ -173,7 +173,7 @@
    v:

    Returns void

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:99
    • diff --git a/docs/classes/AbstractGraph.html b/docs/classes/AbstractGraph.html index a2f581a8..8cfc88ad 100644 --- a/docs/classes/AbstractGraph.html +++ b/docs/classes/AbstractGraph.html @@ -34,7 +34,7 @@

    Implements

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:104
    • @@ -107,7 +107,7 @@

    Properties

    Private _vertices

    _vertices: Map<VertexId, V> = ...
    +
  • Defined in src/data-structures/graph/abstract-graph.ts:109

    • Accessors

    @@ -117,7 +117,7 @@

    vertices

    Returns Map<VertexId, V>

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:111

    • Methods

    @@ -132,7 +132,7 @@

    Parameters

    edge: E

    Returns boolean

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:1017

    • Protected _addVertexOnly

      @@ -145,7 +145,7 @@

      Parameters

      newVertex: V

    Returns boolean

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:1019

    • Protected _getVertex

      @@ -158,7 +158,7 @@

      Parameters

      vertexOrId: VertexId | V

    Returns null | V

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:1028

    • Protected _getVertexId

      @@ -171,7 +171,7 @@

      Parameters

      vertexOrId: VertexId | V

    Returns VertexId

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:1033

    • Protected _setVertices

      @@ -184,7 +184,7 @@

      Parameters

      value: Map<VertexId, V>

    Returns void

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:1037

    • addEdge

  • @@ -215,7 +215,7 @@
    Optional Returns boolean
    • +
  • Defined in src/data-structures/graph/abstract-graph.ts:222

    • addVertex

  • @@ -242,7 +242,7 @@
    Optional Returns boolean
    • +
  • Defined in src/data-structures/graph/abstract-graph.ts:170

    • bellmanFord

      @@ -302,7 +302,7 @@
      pathspreMap: Map<V, V>
    +
  • Defined in src/data-structures/graph/abstract-graph.ts:725

    • Abstract createEdge

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:131

    • Abstract createVertex

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:121

    • Abstract degreeOf

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:137

    • dijkstra

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:596

    • dijkstraWithoutHeap

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:456

    • Abstract edgeSet

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:139

    • Abstract edgesOf

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:141

    • floyd

      @@ -510,7 +510,7 @@
      costspredecessor: (null | V)[][]
    +
  • Defined in src/data-structures/graph/abstract-graph.ts:851

    • getAllPathsBetween

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:268

    • Abstract getEdge

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:135

    • Abstract getEndsOfEdge

      @@ -565,7 +565,7 @@

      Parameters

      edge: E

    Returns null | [V, V]

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:145

    • getMinCostBetween

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:326

    • getMinPathBetween

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:384

    • Abstract getNeighbors

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:143

    • getPathSumWeight

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:304

    • getVertex

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:154

    • hasEdge

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:215

    • hasVertex

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:164

    • removeAllVertices

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:199

    • Abstract removeEdge

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:133

    • removeVertex

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:187

    • setEdgeWeight

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:251

    • tarjan

      @@ -907,7 +907,7 @@
      dfnMaplowMap: Map<V, number>
    +
  • Defined in src/data-structures/graph/abstract-graph.ts:915
    • diff --git a/docs/classes/AbstractVertex.html b/docs/classes/AbstractVertex.html index 9111d174..3c22f941 100644 --- a/docs/classes/AbstractVertex.html +++ b/docs/classes/AbstractVertex.html @@ -28,7 +28,7 @@

    Hierarchy

  • DirectedVertex
  • UndirectedVertex
    • +
  • Defined in src/data-structures/graph/abstract-graph.ts:13
    • @@ -80,19 +80,19 @@
    Optional Returns AbstractVertex<T>
    +
  • Defined in src/data-structures/graph/abstract-graph.ts:21

    • Properties

    Private _id

    _id: VertexId
    +
  • Defined in src/data-structures/graph/abstract-graph.ts:26

    • Private _val

    _val: undefined | T
    +
  • Defined in src/data-structures/graph/abstract-graph.ts:36

    • Accessors

    @@ -102,7 +102,7 @@

    id

    Returns VertexId

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:28
  • set id(v): void
  • @@ -112,7 +112,7 @@

    Parameters

    v: VertexId

    • Returns void

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:32

    • val

  • set val(value): void
  • @@ -130,7 +130,7 @@

    Parameters

    value: undefined | T

    • Returns void

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:42
    • diff --git a/docs/classes/ArrayDeque.html b/docs/classes/ArrayDeque.html index 09857968..8e09e1eb 100644 --- a/docs/classes/ArrayDeque.html +++ b/docs/classes/ArrayDeque.html @@ -25,7 +25,7 @@

    Hierarchy

    • ArrayDeque
    +
  • Defined in src/data-structures/queue/deque.ts:170
    • @@ -76,7 +76,7 @@

    Properties

    Protected _nodes

    _nodes: T[] = []
    +
  • Defined in src/data-structures/queue/deque.ts:171

    • Accessors

    @@ -86,7 +86,7 @@

    size

    Returns number

    +
  • Defined in src/data-structures/queue/deque.ts:173

    • Methods

    @@ -109,7 +109,7 @@

    Returns number

    +
  • Defined in src/data-structures/queue/deque.ts:217

    • addLast

      @@ -129,7 +129,7 @@

      Returns number

    +
  • Defined in src/data-structures/queue/deque.ts:186

    • get

      @@ -151,7 +151,7 @@

      Returns null

    +
  • Defined in src/data-structures/queue/deque.ts:249

    • insert

    +
  • Defined in src/data-structures/queue/deque.ts:275

    • isEmpty

    +
  • Defined in src/data-structures/queue/deque.ts:294

    • peekFirst

    +
  • Defined in src/data-structures/queue/deque.ts:226

    • peekLast

    +
  • Defined in src/data-structures/queue/deque.ts:234

    • pollFirst

    +
  • Defined in src/data-structures/queue/deque.ts:203

    • pollLast

    +
  • Defined in src/data-structures/queue/deque.ts:194

    • remove

    +
  • Defined in src/data-structures/queue/deque.ts:285

    • set

    +
  • Defined in src/data-structures/queue/deque.ts:261
    • diff --git a/docs/classes/BST.html b/docs/classes/BST.html index 3ddc6199..611d1e9b 100644 --- a/docs/classes/BST.html +++ b/docs/classes/BST.html @@ -34,7 +34,7 @@

    Implements

    +
  • Defined in src/data-structures/binary-tree/bst.ts:22
    • @@ -135,14 +135,14 @@

    Returns

    +
  • Defined in src/data-structures/binary-tree/bst.ts:27

    • Properties

    Protected _comparator

    _comparator: BSTComparator = ...
    +
  • Defined in src/data-structures/binary-tree/bst.ts:519

    • Accessors

    @@ -154,7 +154,7 @@

    Returns src/data-structures/binary-tree/abstract-binary-tree.ts:164

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:168

    • root

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:156

    • size

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:162

    • visitedId

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:174

    • visitedLeftSum

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:192

    • visitedNode

      @@ -204,7 +204,7 @@

      Returns src/data-structures/binary-tree/abstract-binary-tree.ts:182

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:186

    • visitedVal

      @@ -214,7 +214,7 @@

      Returns src/data-structures/binary-tree/abstract-binary-tree.ts:176

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:180

    • Methods

    @@ -230,7 +230,7 @@

    Returns numberImplementation of IBST.BFS

    Inherited from BinaryTree.BFS

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:929

  • Performs a breadth-first search (BFS) on a binary tree, accumulating properties of each node based on the specified property name.

    @@ -249,7 +249,7 @@

    Returns numberImplementation of IBST.BFS

    Inherited from BinaryTree.BFS

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:936

  • Performs a breadth-first search (BFS) on a binary tree, accumulating the 'val' property of each node.

    @@ -268,7 +268,7 @@

    Returns IBST.BFS

    Inherited from BinaryTree.BFS

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:943

  • Performs a breadth-first search (BFS) on a binary tree, accumulating nodes themselves.

    @@ -287,7 +287,7 @@

    Returns IBST.BFS

    Inherited from BinaryTree.BFS

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:950

    • DFS

  • Performs a depth-first search (DFS) traversal on a binary tree and accumulates properties of each node based on the specified property name.

    @@ -325,7 +325,7 @@

    Returns numberImplementation of IBST.DFS

    Inherited from BinaryTree.DFS

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:988

  • Performs a depth-first search (DFS) traversal on a binary tree and accumulates the 'val' property of each node.

    @@ -349,7 +349,7 @@

    Returns IBST.DFS

    Inherited from BinaryTree.DFS

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:996

  • Performs a depth-first search (DFS) traversal on a binary tree and accumulates nodes themselves.

    @@ -373,7 +373,7 @@

    Returns IBST.DFS

    Inherited from BinaryTree.DFS

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1004

    • DFSIterative

  • Performs an iterative depth-first search (DFS) traversal on a binary tree and accumulates properties of each node based on the specified property name.

    @@ -411,7 +411,7 @@

    Returns numberImplementation of IBST.DFSIterative

    Inherited from BinaryTree.DFSIterative

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1055

  • Performs an iterative depth-first search (DFS) traversal on a binary tree and accumulates the 'val' property of each node.

    @@ -435,7 +435,7 @@

    Returns IBST.DFSIterative

    Inherited from BinaryTree.DFSIterative

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1063

  • Performs an iterative depth-first search (DFS) traversal on a binary tree and accumulates nodes themselves.

    @@ -459,7 +459,7 @@

    Returns IBST.DFSIterative

    Inherited from BinaryTree.DFSIterative

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1071

    • Protected _accumulatedByPropertyName

      @@ -486,7 +486,7 @@

      Returns void

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1584

    • Protected _addTo

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1438

    • Protected _clearResults

      @@ -529,7 +529,7 @@

      Returns void

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1526

    • Protected _compare

    +
  • Defined in src/data-structures/binary-tree/bst.ts:529

    • Protected _getResultByPropertyName

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1615

    • Protected _pushByPropertyNameStopOrNot

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1548

    • Protected _setLoopType

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1466

    • Protected _setRoot

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1507

    • Protected _setSize

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1518

    • Protected _setVisitedId

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1474

    • Protected _setVisitedLeftSum

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1498

    • Protected _setVisitedNode

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1490

    • Protected _setVisitedVal

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1482

    • add

    +
  • Defined in src/data-structures/binary-tree/bst.ts:58

    • addMany

    +
  • Defined in src/data-structures/binary-tree/bst.ts:134

    • allGreaterNodesAdd

    +
  • Defined in src/data-structures/binary-tree/bst.ts:370

    • clear

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:227

    • createNode

    +
  • Defined in src/data-structures/binary-tree/bst.ts:45

    • fill

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:345

    • get

    +
  • Defined in src/data-structures/binary-tree/bst.ts:211

    • getDepth

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:412

    • getHeight

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:430

    • getLeftMost

  • The function getLeftMost returns the leftmost node in a binary tree, starting from a specified node or the root if @@ -1060,7 +1060,7 @@

    Returns IBST.getLeftMost

    Inherited from BinaryTree.getLeftMost

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:651

    • getMinHeight

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:479

    • getNodes

    +
  • Defined in src/data-structures/binary-tree/bst.ts:240

    • getPathToRoot

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:615

    • getPredecessor

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1284

    • getRightMost

  • The getRightMost function returns the rightmost node in a binary tree, either recursively or iteratively using tail @@ -1213,7 +1213,7 @@

    Returns IBST.getRightMost

    Inherited from BinaryTree.getRightMost

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:705

    • getSubTreeSize

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:789

    • has

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:582

    • isAVLBalanced

    +
  • Defined in src/data-structures/binary-tree/bst.ts:475

    • isBST

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:779

    • isEmpty

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:237

    • isPerfectlyBalanced

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:529

    • isSubtreeBST

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:745

    • lastKey

    +
  • Defined in src/data-structures/binary-tree/bst.ts:223

    • lesserSum

    +
  • Defined in src/data-structures/binary-tree/bst.ts:293

    • levelIterative

  • Performs a level-order traversal on a binary tree starting from the specified node and accumulates properties of each node based on the specified property name.

    @@ -1443,7 +1443,7 @@

    Returns numberImplementation of IBST.levelIterative

    Inherited from BinaryTree.levelIterative

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1138

  • Performs a level-order traversal on a binary tree starting from the specified node and accumulates the 'val' property of each node.

    @@ -1467,7 +1467,7 @@

    Returns IBST.levelIterative

    Inherited from BinaryTree.levelIterative

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1146

  • Performs a level-order traversal on a binary tree starting from the specified node and accumulates nodes themselves.

    @@ -1491,7 +1491,7 @@

    Returns IBST.levelIterative

    Inherited from BinaryTree.levelIterative

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1154

    • listLevels

  • Collects nodes from a binary tree by a specified property and organizes them into levels.

    @@ -1533,7 +1533,7 @@

    Returns numberImplementation of IBST.listLevels

    Inherited from BinaryTree.listLevels

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1205

  • Collects nodes from a binary tree by a specified property and organizes them into levels.

    @@ -1557,7 +1557,7 @@

    Returns IBST.listLevels

    Inherited from BinaryTree.listLevels

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1213

  • Collects nodes from a binary tree by a specified property and organizes them into levels.

    @@ -1581,7 +1581,7 @@

    Returns IBST.listLevels

    Inherited from BinaryTree.listLevels

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1221

    • morris

  • Performs an in-order, pre-order, or post-order traversal on a binary tree using the Morris traversal algorithm and accumulates properties of each node based on the specified property name.

    @@ -1619,7 +1619,7 @@

    Returns numberImplementation of IBST.morris

    Inherited from BinaryTree.morris

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1315

  • Performs an in-order, pre-order, or post-order traversal on a binary tree using the Morris traversal algorithm and accumulates the 'val' property of each node.

    @@ -1643,7 +1643,7 @@

    Returns IBST.morris

    Inherited from BinaryTree.morris

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1323

  • Performs an in-order, pre-order, or post-order traversal on a binary tree using the Morris traversal algorithm and accumulates nodes themselves.

    @@ -1667,7 +1667,7 @@

    Returns IBST.morris

    Inherited from BinaryTree.morris

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1331

    • perfectlyBalance

    +
  • Defined in src/data-structures/binary-tree/bst.ts:434

    • remove

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:360

    • subTreeAdd

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:882

    • subTreeSum

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:826

    • swapLocation

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:205
    • diff --git a/docs/classes/BSTNode.html b/docs/classes/BSTNode.html index 822d2c3d..ec0642ea 100644 --- a/docs/classes/BSTNode.html +++ b/docs/classes/BSTNode.html @@ -36,7 +36,7 @@

    Implements

    +
  • Defined in src/data-structures/binary-tree/bst.ts:13
    • @@ -80,7 +80,7 @@
    Optional Returns BSTNode<T, NEIGHBOR>
    +
  • Defined in src/data-structures/binary-tree/bst.ts:17

    • Accessors

    @@ -96,7 +96,7 @@

    Returns Implementation of IBSTNode.familyPosition

    Inherited from BinaryTreeNode.familyPosition

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:110

    • height

  • set height(v): void
  • @@ -118,7 +118,7 @@

    Returns voidImplementation of IBSTNode.height

    Inherited from BinaryTreeNode.height

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:102

    • id

  • set id(v): void
  • @@ -140,7 +140,7 @@

    Returns voidImplementation of IBSTNode.id

    Inherited from BinaryTreeNode.id

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:46

    • left

  • set left(v): void
  • @@ -162,7 +162,7 @@

    Returns voidImplementation of IBSTNode.left

    Inherited from BinaryTreeNode.left

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:66

    • parent

  • set parent(v): void
  • @@ -184,7 +184,7 @@

    Returns voidImplementation of IBSTNode.parent

    Inherited from BinaryTreeNode.parent

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:92

    • right

  • set right(v): void
  • @@ -206,7 +206,7 @@

    Returns voidImplementation of IBSTNode.right

    Inherited from BinaryTreeNode.right

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:79

    • val

  • set val(value): void
  • @@ -228,7 +228,7 @@

    Returns voidImplementation of IBSTNode.val

    Inherited from BinaryTreeNode.val

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:56
    • diff --git a/docs/classes/BTree.html b/docs/classes/BTree.html index 262fd986..6175893c 100644 --- a/docs/classes/BTree.html +++ b/docs/classes/BTree.html @@ -20,7 +20,7 @@

    Hierarchy

    • BTree
    +
  • Defined in src/data-structures/binary-tree/b-tree.ts:1
    • diff --git a/docs/classes/BinaryIndexedTree.html b/docs/classes/BinaryIndexedTree.html index 219a75e7..f295fadb 100644 --- a/docs/classes/BinaryIndexedTree.html +++ b/docs/classes/BinaryIndexedTree.html @@ -30,7 +30,7 @@

    Hierarchy

    • BinaryIndexedTree
    +
  • Defined in src/data-structures/binary-tree/binary-indexed-tree.ts:8
    • @@ -78,14 +78,14 @@
    n:

    Returns BinaryIndexedTree

    +
  • Defined in src/data-structures/binary-tree/binary-indexed-tree.ts:15

    • Properties

    Private _sumTree

    _sumTree: number[]
    +
  • Defined in src/data-structures/binary-tree/binary-indexed-tree.ts:19

    • Accessors

    @@ -95,7 +95,7 @@

    sumTree

    Returns number[]

    +
  • Defined in src/data-structures/binary-tree/binary-indexed-tree.ts:21

    • Methods

    @@ -110,7 +110,7 @@

    Parameters

    value: number[]

    Returns void

    +
  • Defined in src/data-structures/binary-tree/binary-indexed-tree.ts:73

    • getPrefixSum

      @@ -132,7 +132,7 @@

      Returns number

    +
  • Defined in src/data-structures/binary-tree/binary-indexed-tree.ts:51

    • getRangeSum

      @@ -159,7 +159,7 @@

      Returns number

    +
  • Defined in src/data-structures/binary-tree/binary-indexed-tree.ts:68

    • update

    +
  • Defined in src/data-structures/binary-tree/binary-indexed-tree.ts:37

    • Static lowBit

      @@ -199,7 +199,7 @@

      Parameters

      x: number

    Returns number

    +
  • Defined in src/data-structures/binary-tree/binary-indexed-tree.ts:25
    • diff --git a/docs/classes/BinaryTree.html b/docs/classes/BinaryTree.html index 8d3b7723..a7f6c100 100644 --- a/docs/classes/BinaryTree.html +++ b/docs/classes/BinaryTree.html @@ -33,7 +33,7 @@

    Implements

    +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:22
    • @@ -126,7 +126,7 @@

    Returns

    +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:32

    • Accessors

    @@ -138,7 +138,7 @@

    Returns src/data-structures/binary-tree/abstract-binary-tree.ts:164

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:168

    • root

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:156

    • size

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:162

    • visitedId

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:174

    • visitedLeftSum

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:192

    • visitedNode

      @@ -188,7 +188,7 @@

      Returns src/data-structures/binary-tree/abstract-binary-tree.ts:182

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:186

    • visitedVal

      @@ -198,7 +198,7 @@

      Returns src/data-structures/binary-tree/abstract-binary-tree.ts:176

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:180

    • Methods

    @@ -214,7 +214,7 @@

    Returns numberImplementation of IBinaryTree.BFS

    Inherited from AbstractBinaryTree.BFS

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:929

  • Performs a breadth-first search (BFS) on a binary tree, accumulating properties of each node based on the specified property name.

    @@ -233,7 +233,7 @@

    Returns numberImplementation of IBinaryTree.BFS

    Inherited from AbstractBinaryTree.BFS

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:936

  • Performs a breadth-first search (BFS) on a binary tree, accumulating the 'val' property of each node.

    @@ -252,7 +252,7 @@

    Returns AbstractBinaryTree.BFS

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:943

  • Performs a breadth-first search (BFS) on a binary tree, accumulating nodes themselves.

    @@ -271,7 +271,7 @@

    Returns AbstractBinaryTree.BFS

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:950

    • DFS

  • Performs a depth-first search (DFS) traversal on a binary tree and accumulates properties of each node based on the specified property name.

    @@ -309,7 +309,7 @@

    Returns numberImplementation of IBinaryTree.DFS

    Inherited from AbstractBinaryTree.DFS

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:988

  • Performs a depth-first search (DFS) traversal on a binary tree and accumulates the 'val' property of each node.

    @@ -333,7 +333,7 @@

    Returns AbstractBinaryTree.DFS

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:996

  • Performs a depth-first search (DFS) traversal on a binary tree and accumulates nodes themselves.

    @@ -357,7 +357,7 @@

    Returns AbstractBinaryTree.DFS

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1004

    • DFSIterative

  • Performs an iterative depth-first search (DFS) traversal on a binary tree and accumulates properties of each node based on the specified property name.

    @@ -395,7 +395,7 @@

    Returns numberImplementation of IBinaryTree.DFSIterative

    Inherited from AbstractBinaryTree.DFSIterative

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1055

  • Performs an iterative depth-first search (DFS) traversal on a binary tree and accumulates the 'val' property of each node.

    @@ -419,7 +419,7 @@

    Returns AbstractBinaryTree.DFSIterative

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1063

  • Performs an iterative depth-first search (DFS) traversal on a binary tree and accumulates nodes themselves.

    @@ -443,7 +443,7 @@

    Returns AbstractBinaryTree.DFSIterative

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1071

    • Protected _accumulatedByPropertyName

      @@ -470,7 +470,7 @@

      Returns void

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1584

    • Protected _addTo

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1438

    • Protected _clearResults

      @@ -513,7 +513,7 @@

      Returns void

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1526

    • Protected _getResultByPropertyName

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1615

    • Protected _pushByPropertyNameStopOrNot

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1548

    • Protected _setLoopType

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1466

    • Protected _setRoot

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1507

    • Protected _setSize

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1518

    • Protected _setVisitedId

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1474

    • Protected _setVisitedLeftSum

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1498

    • Protected _setVisitedNode

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1490

    • Protected _setVisitedVal

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1482

    • add

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:255

    • addMany

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:314

    • clear

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:227

    • createNode

    +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:44

    • fill

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:345

    • get

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:599

    • getDepth

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:412

    • getHeight

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:430

    • getLeftMost

  • The function getLeftMost returns the leftmost node in a binary tree, starting from a specified node or the root if @@ -980,7 +980,7 @@

    Returns AbstractBinaryTree.getLeftMost

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:651

    • getMinHeight

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:479

    • getNodes

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:544

    • getPathToRoot

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:615

    • getPredecessor

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1284

    • getRightMost

  • The getRightMost function returns the rightmost node in a binary tree, either recursively or iteratively using tail @@ -1133,7 +1133,7 @@

    Returns AbstractBinaryTree.getRightMost

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:705

    • getSubTreeSize

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:789

    • has

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:582

    • isBST

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:779

    • isEmpty

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:237

    • isPerfectlyBalanced

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:529

    • isSubtreeBST

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:745

    • levelIterative

  • Performs a level-order traversal on a binary tree starting from the specified node and accumulates properties of each node based on the specified property name.

    @@ -1305,7 +1305,7 @@

    Returns numberImplementation of IBinaryTree.levelIterative

    Inherited from AbstractBinaryTree.levelIterative

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1138

  • Performs a level-order traversal on a binary tree starting from the specified node and accumulates the 'val' property of each node.

    @@ -1329,7 +1329,7 @@

    Returns AbstractBinaryTree.levelIterative

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1146

  • Performs a level-order traversal on a binary tree starting from the specified node and accumulates nodes themselves.

    @@ -1353,7 +1353,7 @@

    Returns AbstractBinaryTree.levelIterative

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1154

    • listLevels

  • Collects nodes from a binary tree by a specified property and organizes them into levels.

    @@ -1395,7 +1395,7 @@

    Returns numberImplementation of IBinaryTree.listLevels

    Inherited from AbstractBinaryTree.listLevels

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1205

  • Collects nodes from a binary tree by a specified property and organizes them into levels.

    @@ -1419,7 +1419,7 @@

    Returns AbstractBinaryTree.listLevels

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1213

  • Collects nodes from a binary tree by a specified property and organizes them into levels.

    @@ -1443,7 +1443,7 @@

    Returns AbstractBinaryTree.listLevels

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1221

    • morris

  • Performs an in-order, pre-order, or post-order traversal on a binary tree using the Morris traversal algorithm and accumulates properties of each node based on the specified property name.

    @@ -1481,7 +1481,7 @@

    Returns numberImplementation of IBinaryTree.morris

    Inherited from AbstractBinaryTree.morris

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1315

  • Performs an in-order, pre-order, or post-order traversal on a binary tree using the Morris traversal algorithm and accumulates the 'val' property of each node.

    @@ -1505,7 +1505,7 @@

    Returns AbstractBinaryTree.morris

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1323

  • Performs an in-order, pre-order, or post-order traversal on a binary tree using the Morris traversal algorithm and accumulates nodes themselves.

    @@ -1529,7 +1529,7 @@

    Returns AbstractBinaryTree.morris

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1331

    • remove

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:360

    • subTreeAdd

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:882

    • subTreeSum

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:826

    • swapLocation

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:205
    • diff --git a/docs/classes/BinaryTreeNode.html b/docs/classes/BinaryTreeNode.html index 6c9b79b7..d303b4e6 100644 --- a/docs/classes/BinaryTreeNode.html +++ b/docs/classes/BinaryTreeNode.html @@ -35,7 +35,7 @@

    Implements

    +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:13
    • @@ -79,7 +79,7 @@
    Optional Returns BinaryTreeNode<T, NEIGHBOR>
    +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:17

    • Accessors

    @@ -95,7 +95,7 @@

    Returns Implementation of IBinaryTreeNode.familyPosition

    Inherited from AbstractBinaryTreeNode.familyPosition

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:110

    • height

  • set height(v): void
  • @@ -117,7 +117,7 @@

    Returns voidImplementation of IBinaryTreeNode.height

    Inherited from AbstractBinaryTreeNode.height

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:102

    • id

  • set id(v): void
  • @@ -139,7 +139,7 @@

    Returns voidImplementation of IBinaryTreeNode.id

    Inherited from AbstractBinaryTreeNode.id

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:46

    • left

  • set left(v): void
  • @@ -161,7 +161,7 @@

    Returns voidImplementation of IBinaryTreeNode.left

    Inherited from AbstractBinaryTreeNode.left

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:66

    • parent

  • set parent(v): void
  • @@ -183,7 +183,7 @@

    Returns voidImplementation of IBinaryTreeNode.parent

    Inherited from AbstractBinaryTreeNode.parent

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:92

    • right

  • set right(v): void
  • @@ -205,7 +205,7 @@

    Returns voidImplementation of IBinaryTreeNode.right

    Inherited from AbstractBinaryTreeNode.right

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:79

    • val

  • set val(value): void
  • @@ -227,7 +227,7 @@

    Returns voidImplementation of IBinaryTreeNode.val

    Inherited from AbstractBinaryTreeNode.val

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:56
    • diff --git a/docs/classes/Character.html b/docs/classes/Character.html index 5e58a7ca..c29283cc 100644 --- a/docs/classes/Character.html +++ b/docs/classes/Character.html @@ -20,7 +20,7 @@

    Hierarchy

    • Character
    +
  • Defined in src/data-structures/matrix/navigator.ts:10
    • @@ -63,14 +63,14 @@
    turning: Returns Character
    +
  • Defined in src/data-structures/matrix/navigator.ts:22

    • Properties

    direction

    direction: Direction
    +
  • Defined in src/data-structures/matrix/navigator.ts:11

    • turn

    turn: (() => Character)
    @@ -83,7 +83,7 @@

    Type declaration

  • Returns Character

    • +
  • Defined in src/data-structures/matrix/navigator.ts:12
    • diff --git a/docs/classes/CoordinateMap.html b/docs/classes/CoordinateMap.html index ed187d62..76f2292e 100644 --- a/docs/classes/CoordinateMap.html +++ b/docs/classes/CoordinateMap.html @@ -37,7 +37,7 @@

    Hierarchy

    • CoordinateMap
    +
  • Defined in src/data-structures/hash/coordinate-map.ts:8
    • @@ -92,7 +92,7 @@
    Optional Returns CoordinateMap<V>
    +
  • Defined in src/data-structures/hash/coordinate-map.ts:9

    • Properties

    @@ -105,7 +105,7 @@

    ReadonlyProtected _joint

    _joint: string = '_'
    +
  • Defined in src/data-structures/hash/coordinate-map.ts:14

    • Readonly size

    size: number
    @@ -130,7 +130,7 @@

    joint

    Returns string

    +
  • Defined in src/data-structures/hash/coordinate-map.ts:16

    • Methods

    @@ -157,7 +157,7 @@

    Parameters

    v: string

    Returns void

    +
  • Defined in src/data-structures/hash/coordinate-map.ts:64

    • clear

      @@ -189,7 +189,7 @@

      Returns boolean

    +
  • Defined in src/data-structures/hash/coordinate-map.ts:60

    • entries

    +
  • Defined in src/data-structures/hash/coordinate-map.ts:49

    • has

      @@ -280,7 +280,7 @@

      Returns boolean

    +
  • Defined in src/data-structures/hash/coordinate-map.ts:27

    • keys

      @@ -320,7 +320,7 @@

      Returns

    +
  • Defined in src/data-structures/hash/coordinate-map.ts:39

    • values

      diff --git a/docs/classes/CoordinateSet.html b/docs/classes/CoordinateSet.html index e53cde6e..d36b508d 100644 --- a/docs/classes/CoordinateSet.html +++ b/docs/classes/CoordinateSet.html @@ -32,7 +32,7 @@

      Hierarchy

      • CoordinateSet
    +
  • Defined in src/data-structures/hash/coordinate-set.ts:8
    • @@ -81,7 +81,7 @@
    Optional Returns CoordinateSet
    +
  • Defined in src/data-structures/hash/coordinate-set.ts:9

    • Properties

    @@ -94,7 +94,7 @@

    ReadonlyProtected _joint

    _joint: string = '_'
    +
  • Defined in src/data-structures/hash/coordinate-set.ts:14

    • Readonly size

    size: number
    @@ -119,7 +119,7 @@

    joint

    Returns string

    +
  • Defined in src/data-structures/hash/coordinate-set.ts:16

    • Methods

    @@ -146,7 +146,7 @@

    Parameters

    v: string

    Returns void

    +
  • Defined in src/data-structures/hash/coordinate-set.ts:53

    • add

    +
  • Defined in src/data-structures/hash/coordinate-set.ts:38

    • clear

    +
  • Defined in src/data-structures/hash/coordinate-set.ts:49

    • entries

    +
  • Defined in src/data-structures/hash/coordinate-set.ts:27

    • keys

      diff --git a/docs/classes/Deque.html b/docs/classes/Deque.html index 647328d0..4682cc71 100644 --- a/docs/classes/Deque.html +++ b/docs/classes/Deque.html @@ -27,7 +27,7 @@

      Hierarchy

      • Deque
    +
  • Defined in src/data-structures/queue/deque.ts:12
    • @@ -88,7 +88,7 @@

    Returns

    +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:55

    • Accessors

    @@ -99,7 +99,7 @@

    headReturns null | DoublyLinkedListNode<T>

    +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:63
  • set head(value): void
  • @@ -110,7 +110,7 @@
    value: Returns void
    • +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:67

    • length

    +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:83

    • tail

  • set tail(value): void
  • @@ -139,7 +139,7 @@
    value: Returns void
    • +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:77

    • Methods

    @@ -153,7 +153,7 @@

    Returns void

    +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:332

    • delete

  • The delete function removes a node from a doubly linked list based on either the node itself or its value.

    @@ -196,7 +196,7 @@

    Returns boolean

    • +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:280

    • deleteAt

    +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:265

    • filter

    +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:463

    • find

    +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:345

    • findLast

    +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:384

    • findNode

    +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:214

    • forEach

    +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:428

    • getAt

    +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:181

    • getNodeAt

    +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:198

    • indexOf

    +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:363

    • insertAfter

  • The insertAfter function inserts a new node with a given value after an existing node in a doubly linked list.

    @@ -505,7 +505,7 @@

    Returns boolean

    • +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:496

    • insertAt

    +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:236

    • insertBefore

  • The insertBefore function inserts a new value before an existing value or node in a doubly linked list.

    @@ -591,7 +591,7 @@

    Returns boolean

    • +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:535

    • map

    +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:446

    • pop

    +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:123

    • push

    +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:105

    • reduce

    +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:485

    • reverse

    +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:412

    • shift

    +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:142

    • toArray

    +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:319

    • toArrayReverse

    +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:399

    • unshift

    +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:161

    • Static fromArray

    +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:93
    • diff --git a/docs/classes/DirectedEdge.html b/docs/classes/DirectedEdge.html index 32b5a053..a53481a1 100644 --- a/docs/classes/DirectedEdge.html +++ b/docs/classes/DirectedEdge.html @@ -29,7 +29,7 @@

    Hierarchy

    +
  • Defined in src/data-structures/graph/directed-graph.ts:26
    • @@ -102,25 +102,25 @@

    Returns

    +
  • Defined in src/data-structures/graph/directed-graph.ts:38

    • Properties

    Private _dest

    _dest: VertexId
    +
  • Defined in src/data-structures/graph/directed-graph.ts:54

    • Protected _hashCode

    _hashCode: string
    +
  • Defined in src/data-structures/graph/abstract-graph.ts:83

    • Private _src

    _src: VertexId
    +
  • Defined in src/data-structures/graph/directed-graph.ts:44

    • Accessors

    @@ -130,7 +130,7 @@

    dest

    Returns VertexId

    +
  • Defined in src/data-structures/graph/directed-graph.ts:56
  • set dest(v): void
  • @@ -140,7 +140,7 @@

    Parameters

    v: VertexId

    • Returns void

    +
  • Defined in src/data-structures/graph/directed-graph.ts:60

    • hashCode

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:85

    • src

  • set src(v): void
  • @@ -167,7 +167,7 @@

    Parameters

    v: VertexId

    • Returns void

    +
  • Defined in src/data-structures/graph/directed-graph.ts:50

    • val

  • set val(value): void
  • @@ -187,7 +187,7 @@
    value: Returns void
    • +
  • Defined in src/data-structures/graph/abstract-graph.ts:69

    • weight

  • set weight(v): void
  • @@ -207,7 +207,7 @@
    v:

    Returns void

    • +
  • Defined in src/data-structures/graph/abstract-graph.ts:79

    • Methods

    @@ -230,7 +230,7 @@

    Returns void

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:99
    • diff --git a/docs/classes/DirectedGraph.html b/docs/classes/DirectedGraph.html index f7261ea6..be30872c 100644 --- a/docs/classes/DirectedGraph.html +++ b/docs/classes/DirectedGraph.html @@ -35,7 +35,7 @@

    Implements

    +
  • Defined in src/data-structures/graph/directed-graph.ts:65
    • @@ -122,19 +122,19 @@

    Returns

    +
  • Defined in src/data-structures/graph/directed-graph.ts:72

    • Properties

    Private _inEdgeMap

    _inEdgeMap: Map<V, E[]> = ...
    +
  • Defined in src/data-structures/graph/directed-graph.ts:82

    • Private _outEdgeMap

    _outEdgeMap: Map<V, E[]> = ...
    +
  • Defined in src/data-structures/graph/directed-graph.ts:76

    • Accessors

    @@ -144,7 +144,7 @@

    inEdgeMap

    Returns Map<V, E[]>

    +
  • Defined in src/data-structures/graph/directed-graph.ts:84

    • outEdgeMap

    +
  • Defined in src/data-structures/graph/directed-graph.ts:78

    • vertices

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:111

    • Methods

    @@ -186,7 +186,7 @@

    Returns boolean

    +
  • Defined in src/data-structures/graph/directed-graph.ts:434

    • Protected _addVertexOnly

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:1019

    • Protected _getVertex

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:1028

    • Protected _getVertexId

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:1033

    • Protected _setInEdgeMap

      @@ -241,7 +241,7 @@

      Parameters

      value: Map<V, E[]>

    Returns void

    +
  • Defined in src/data-structures/graph/directed-graph.ts:467

    • Protected _setOutEdgeMap

      @@ -254,7 +254,7 @@

      Parameters

      value: Map<V, E[]>

    Returns void

    +
  • Defined in src/data-structures/graph/directed-graph.ts:463

    • Protected _setVertices

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:1037

    • addEdge

  • @@ -301,7 +301,7 @@

    Returns booleanImplementation of IDirectedGraph.addEdge

    Inherited from AbstractGraph.addEdge

    • +
  • Defined in src/data-structures/graph/abstract-graph.ts:222

    • addVertex

  • @@ -330,7 +330,7 @@

    Returns booleanImplementation of IDirectedGraph.addVertex

    Inherited from AbstractGraph.addVertex

    • +
  • Defined in src/data-structures/graph/abstract-graph.ts:170

    • bellmanFord

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:725

    • createEdge

    +
  • Defined in src/data-structures/graph/directed-graph.ts:121

    • createVertex

    +
  • Defined in src/data-structures/graph/directed-graph.ts:102

    • degreeOf

    +
  • Defined in src/data-structures/graph/directed-graph.ts:257

    • dijkstra

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:596

    • dijkstraWithoutHeap

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:456

    • edgeSet

    +
  • Defined in src/data-structures/graph/directed-graph.ts:377

    • edgesOf

    +
  • Defined in src/data-structures/graph/directed-graph.ts:284

    • floyd

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:851

    • getAllPathsBetween

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:268

    • getDestinations

    +
  • Defined in src/data-structures/graph/directed-graph.ts:312

    • getEdge

    +
  • Defined in src/data-structures/graph/directed-graph.ts:133

    • getEdgeDest

    +
  • Defined in src/data-structures/graph/directed-graph.ts:302

    • getEdgeSrc

    +
  • Defined in src/data-structures/graph/directed-graph.ts:293

    • getEndsOfEdge

    +
  • Defined in src/data-structures/graph/directed-graph.ts:414

    • getMinCostBetween

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:326

    • getMinPathBetween

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:384

    • getNeighbors

    +
  • Defined in src/data-structures/graph/directed-graph.ts:391

    • getPathSumWeight

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:304

    • getVertex

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:154

    • hasEdge

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:215

    • hasVertex

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:164

    • inDegreeOf

    +
  • Defined in src/data-structures/graph/directed-graph.ts:266

    • incomingEdgesOf

    +
  • Defined in src/data-structures/graph/directed-graph.ts:230

    • outDegreeOf

    +
  • Defined in src/data-structures/graph/directed-graph.ts:275

    • outgoingEdgesOf

    +
  • Defined in src/data-structures/graph/directed-graph.ts:244

    • removeAllVertices

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:199

    • removeEdge

    +
  • Defined in src/data-structures/graph/directed-graph.ts:183

    • removeEdgeSrcToDest

    +
  • Defined in src/data-structures/graph/directed-graph.ts:157

    • removeEdgesBetween

    +
  • Defined in src/data-structures/graph/directed-graph.ts:210

    • removeVertex

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:187

    • setEdgeWeight

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:251

    • tarjan

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:915

    • topologicalSort

    +
  • Defined in src/data-structures/graph/directed-graph.ts:335
    • diff --git a/docs/classes/DirectedVertex.html b/docs/classes/DirectedVertex.html index 3efdfce9..23433e7b 100644 --- a/docs/classes/DirectedVertex.html +++ b/docs/classes/DirectedVertex.html @@ -29,7 +29,7 @@

    Hierarchy

    +
  • Defined in src/data-structures/graph/directed-graph.ts:13
    • @@ -77,7 +77,7 @@

    Returns

    +
  • Defined in src/data-structures/graph/directed-graph.ts:21

    • Accessors

    @@ -88,7 +88,7 @@

    idReturns VertexId

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:28
  • set id(v): void
  • @@ -99,7 +99,7 @@
    v: Returns void
    • +
  • Defined in src/data-structures/graph/abstract-graph.ts:32

    • val

  • set val(value): void
  • @@ -119,7 +119,7 @@
    value: Returns void
    • +
  • Defined in src/data-structures/graph/abstract-graph.ts:42
    • diff --git a/docs/classes/DoublyLinkedList.html b/docs/classes/DoublyLinkedList.html index d76d5228..951cdf7c 100644 --- a/docs/classes/DoublyLinkedList.html +++ b/docs/classes/DoublyLinkedList.html @@ -27,7 +27,7 @@

    Hierarchy

    +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:51
    • @@ -93,24 +93,24 @@

    T = Returns DoublyLinkedList<T>

    +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:55

    • Properties

    Private _head

    _head: null | DoublyLinkedListNode<T>
    +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:61

    • Private _length

    _length: number
    +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:81

    • Private _tail

    _tail: null | DoublyLinkedListNode<T>
    +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:71

    • Accessors

    @@ -120,7 +120,7 @@

    head

    Returns null | DoublyLinkedListNode<T>

    +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:63
  • set head(value): void
  • @@ -130,7 +130,7 @@

    Parameters

    value: null | DoublyLinkedListNode<T>

    • Returns void

    +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:67

    • length

    +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:83

    • tail

  • set tail(value): void
  • @@ -156,7 +156,7 @@

    Parameters

    value: null | DoublyLinkedListNode<T>

    • Returns void

    +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:77

    • Methods

    @@ -169,7 +169,7 @@

    clearReturns void

    +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:332

    • delete

      @@ -191,7 +191,7 @@

      Returns boolean

    +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:279

  • The delete function removes a node from a doubly linked list based on either the node itself or its value.

    @@ -210,7 +210,7 @@

    Returns boolean

    • +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:280

    • deleteAt

    +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:265

    • filter

    +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:463

    • find

    +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:345

    • findLast

    +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:384

    • findNode

    +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:214

    • forEach

    +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:428

    • getAt

    +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:181

    • getNodeAt

    +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:198

    • indexOf

    +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:363

    • insertAfter

  • The insertAfter function inserts a new node with a given value after an existing node in a doubly linked list.

    @@ -508,7 +508,7 @@

    Returns boolean

    • +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:496

    • insertAt

    +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:236

    • insertBefore

  • The insertBefore function inserts a new value before an existing value or node in a doubly linked list.

    @@ -591,7 +591,7 @@

    Returns boolean

    • +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:535

    • map

    +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:446

    • pop

    +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:123

    • push

    +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:105

    • reduce

    +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:485

    • reverse

    +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:412

    • shift

    +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:142

    • toArray

    +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:319

    • toArrayReverse

    +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:399

    • unshift

    +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:161

    • Static fromArray

    +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:93
    • diff --git a/docs/classes/DoublyLinkedListNode.html b/docs/classes/DoublyLinkedListNode.html index 91b52e29..3a0183bf 100644 --- a/docs/classes/DoublyLinkedListNode.html +++ b/docs/classes/DoublyLinkedListNode.html @@ -35,7 +35,7 @@

    Hierarchy

    • DoublyLinkedListNode
    +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:8
    • @@ -83,24 +83,24 @@
    val: Returns DoublyLinkedListNode<T>
    +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:14

    • Properties

    Private _next

    _next: null | DoublyLinkedListNode<T>
    +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:30

    • Private _prev

    _prev: null | DoublyLinkedListNode<T>
    +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:40

    • Private _val

    _val: T
    +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:20

    • Accessors

    @@ -110,7 +110,7 @@

    next

    Returns null | DoublyLinkedListNode<T>

    +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:32
  • set next(value): void
  • @@ -120,7 +120,7 @@

    Parameters

    value: null | DoublyLinkedListNode<T>

    • Returns void

    +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:36

    • prev

  • set prev(value): void
  • @@ -138,7 +138,7 @@

    Parameters

    value: null | DoublyLinkedListNode<T>

    • Returns void

    +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:46

    • val

  • set val(value): void
  • @@ -156,7 +156,7 @@

    Parameters

    value: T

    • Returns void

    +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:26
    • diff --git a/docs/classes/HashTable.html b/docs/classes/HashTable.html index e1c2bb94..31b91200 100644 --- a/docs/classes/HashTable.html +++ b/docs/classes/HashTable.html @@ -20,7 +20,7 @@

    Hierarchy

    • HashTable
    +
  • Defined in src/data-structures/hash/hash-table.ts:1
    • diff --git a/docs/classes/Heap.html b/docs/classes/Heap.html index 6e2996b5..d9c11b1f 100644 --- a/docs/classes/Heap.html +++ b/docs/classes/Heap.html @@ -28,7 +28,7 @@

    Hierarchy

  • MaxHeap
  • MinHeap
    • +
  • Defined in src/data-structures/heap/heap.ts:45
    • @@ -87,14 +87,14 @@
    Optional Returns Heap<T>
    +
  • Defined in src/data-structures/heap/heap.ts:51

    • Properties

    Protected Abstract _pq

    _pq: PriorityQueue<HeapItem<T>>
    +
  • Defined in src/data-structures/heap/heap.ts:63

    • Protected _priorityExtractor

    _priorityExtractor: ((val) => number)
    @@ -112,7 +112,7 @@

    Parameters

    val: T

    Returns number

    +
  • Defined in src/data-structures/heap/heap.ts:69

    • Accessors

    @@ -122,7 +122,7 @@

    pq

    Returns PriorityQueue<HeapItem<T>>

    +
  • Defined in src/data-structures/heap/heap.ts:65

    • priorityExtractor

      @@ -141,7 +141,7 @@

      Parameters

      val: T

    Returns number

    +
  • Defined in src/data-structures/heap/heap.ts:70

    • size

    +
  • Defined in src/data-structures/heap/heap.ts:78

    • Methods

    @@ -185,7 +185,7 @@

    Returns

    +
  • Defined in src/data-structures/heap/heap.ts:130

    • clear

    +
  • Defined in src/data-structures/heap/heap.ts:209

    • has

    +
  • Defined in src/data-structures/heap/heap.ts:160

    • isEmpty

    +
  • Defined in src/data-structures/heap/heap.ts:86

    • peek

  • The peek function returns the top item in the priority queue without removing it.

    @@ -259,7 +259,7 @@

    Returns undefined

    • +
  • Defined in src/data-structures/heap/heap.ts:91

  • The peek function returns the top item in the priority queue without removing it.

    @@ -273,7 +273,7 @@

    Returns null

    • +
  • Defined in src/data-structures/heap/heap.ts:92

    • peekLast

  • The peekLast function returns the last item in the heap.

    @@ -304,7 +304,7 @@

    Returns undefined

    • +
  • Defined in src/data-structures/heap/heap.ts:106

  • The peekLast function returns the last item in the heap.

    @@ -318,7 +318,7 @@

    Returns null

    • +
  • Defined in src/data-structures/heap/heap.ts:107

    • poll

  • The poll function returns the top item from a priority queue or null if the queue is empty.Removes and returns an val with the highest priority in the queue

    @@ -349,7 +349,7 @@

    Returns undefined

    • +
  • Defined in src/data-structures/heap/heap.ts:138

  • The poll function returns the top item from a priority queue or null if the queue is empty.Removes and returns an val with the highest priority in the queue

    @@ -363,7 +363,7 @@

    Returns null

    • +
  • Defined in src/data-structures/heap/heap.ts:139

    • sort

  • The function sorts the elements in the priority queue and returns either the sorted items or their values depending @@ -404,7 +404,7 @@

    isItem: Returns (undefined | T)[]
    • +
  • Defined in src/data-structures/heap/heap.ts:188

  • The function sorts the elements in the priority queue and returns either the sorted items or their values depending @@ -423,7 +423,7 @@

    isItem: Returns (null | HeapItem<T>)[]
    • +
  • Defined in src/data-structures/heap/heap.ts:189

    • toArray

  • The toArray function returns an array of HeapItem<T> objects.

    @@ -454,7 +454,7 @@

    Returns (

    • +
  • Defined in src/data-structures/heap/heap.ts:173

  • The toArray function returns an array of HeapItem<T> objects.

    @@ -468,7 +468,7 @@

    Returns (

    • +
  • Defined in src/data-structures/heap/heap.ts:174
    • diff --git a/docs/classes/HeapItem.html b/docs/classes/HeapItem.html index 728d4202..ef1a8533 100644 --- a/docs/classes/HeapItem.html +++ b/docs/classes/HeapItem.html @@ -25,7 +25,7 @@

    Hierarchy

    • HeapItem
    +
  • Defined in src/data-structures/heap/heap.ts:11
    • @@ -77,19 +77,19 @@
    Optional Returns HeapItem<T>
    +
  • Defined in src/data-structures/heap/heap.ts:19

    • Properties

    Private _priority

    _priority: number
    +
  • Defined in src/data-structures/heap/heap.ts:24

    • Private _val

    _val: null | T
    +
  • Defined in src/data-structures/heap/heap.ts:34

    • Accessors

    @@ -99,7 +99,7 @@

    priority

    Returns number

     +
  • Defined in src/data-structures/heap/heap.ts:26
  • set priority(value): void
  • @@ -109,7 +109,7 @@

    Parameters

    value: number

    • Returns void

    +
  • Defined in src/data-structures/heap/heap.ts:30

    • val

  • set val(value): void
  • @@ -127,7 +127,7 @@

    Parameters

    value: null | T

    • Returns void

    +
  • Defined in src/data-structures/heap/heap.ts:40
    • diff --git a/docs/classes/LinkedListQueue.html b/docs/classes/LinkedListQueue.html index 66421dd1..d02cd76d 100644 --- a/docs/classes/LinkedListQueue.html +++ b/docs/classes/LinkedListQueue.html @@ -27,7 +27,7 @@

    Hierarchy

    • LinkedListQueue
    +
  • Defined in src/data-structures/queue/queue.ts:8
    • @@ -89,7 +89,7 @@

    Returns

    +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:44

    • Accessors

    @@ -100,7 +100,7 @@

    headReturns null | SinglyLinkedListNode<T>

    +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:52
  • set head(value): void
  • @@ -111,7 +111,7 @@
    value: Returns void
    • +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:56

    • length

    +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:72

    • tail

  • set tail(value): void
  • @@ -140,7 +140,7 @@
    value: Returns void
    • +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:66

    • Methods

    @@ -151,7 +151,7 @@

    [iterator]Returns Generator<T, void, unknown>

    +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:493

    • clear

      @@ -163,7 +163,7 @@

      Returns void

    +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:300

    • countOccurrences

      @@ -184,7 +184,7 @@

      Returns number

    +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:479

    • delete

  • The delete function removes a node with a specific value from a singly linked list.

    @@ -227,7 +227,7 @@

    Returns boolean

    • +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:218

    • deleteAt

    +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:205

    • dequeue

    +
  • Defined in src/data-structures/queue/queue.ts:21

    • enqueue

    +
  • Defined in src/data-structures/queue/queue.ts:13

    • find

    +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:348

    • findNode

    +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:387

    • getAt

    +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:174

    • getLength

    +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:90

    • getNodeAt

    +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:190

    • indexOf

    +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:365

    • insertAfter

  • The insertAfter function inserts a new node with a given value after an existing node in a singly linked list.

    @@ -468,7 +468,7 @@

    Returns boolean

    • +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:441

    • insertAt

    +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:269

    • insertBefore

  • The insertBefore function inserts a new value before an existing value in a singly linked list.

    @@ -542,7 +542,7 @@

    Returns boolean

    • +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:401

    • isEmpty

    +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:293

    • peek

    +
  • Defined in src/data-structures/queue/queue.ts:29

    • pop

    +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:117

    • push

    +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:99

    • reverse

    +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:324

    • shift

    +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:142

    • toArray

    +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:310

    • unshift

    +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:155

    • Static fromArray

    +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:82
    • diff --git a/docs/classes/MapEdge.html b/docs/classes/MapEdge.html index 8cc453cd..9a57c89e 100644 --- a/docs/classes/MapEdge.html +++ b/docs/classes/MapEdge.html @@ -27,7 +27,7 @@

    Hierarchy

    • MapEdge
    +
  • Defined in src/data-structures/graph/map-graph.ts:44
    • @@ -97,7 +97,7 @@

    Returns

    +
  • Defined in src/data-structures/graph/map-graph.ts:55

    • Properties

    @@ -105,7 +105,7 @@

    Protected_hashCode: string

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:83

    • Accessors

    @@ -116,7 +116,7 @@

    destReturns VertexId

    +
  • Defined in src/data-structures/graph/directed-graph.ts:56
  • set dest(v): void
  • @@ -127,7 +127,7 @@
    v: Returns void
    • +
  • Defined in src/data-structures/graph/directed-graph.ts:60

    • hashCode

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:85

    • src

  • set src(v): void
  • @@ -156,7 +156,7 @@
    v: Returns void
    • +
  • Defined in src/data-structures/graph/directed-graph.ts:50

    • val

  • set val(value): void
  • @@ -176,7 +176,7 @@
    value: Returns void
    • +
  • Defined in src/data-structures/graph/abstract-graph.ts:69

    • weight

  • set weight(v): void
  • @@ -196,7 +196,7 @@
    v:

    Returns void

    • +
  • Defined in src/data-structures/graph/abstract-graph.ts:79

    • Methods

    @@ -219,7 +219,7 @@

    Returns void

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:99
    • diff --git a/docs/classes/MapGraph.html b/docs/classes/MapGraph.html index e206896b..d3240827 100644 --- a/docs/classes/MapGraph.html +++ b/docs/classes/MapGraph.html @@ -29,7 +29,7 @@

    Hierarchy

    • MapGraph
    +
  • Defined in src/data-structures/graph/map-graph.ts:60
    • @@ -135,19 +135,19 @@

    Returns

    +
  • Defined in src/data-structures/graph/map-graph.ts:73

    • Properties

    Private _bottomRight

    _bottomRight: undefined | MapGraphCoordinate
    +
  • Defined in src/data-structures/graph/map-graph.ts:89

    • Private _origin

    _origin: MapGraphCoordinate = ...
    +
  • Defined in src/data-structures/graph/map-graph.ts:79

    • Accessors

    @@ -157,7 +157,7 @@

    bottomRight

    Returns undefined | MapGraphCoordinate

    +
  • Defined in src/data-structures/graph/map-graph.ts:91
  • set bottomRight(value): void
  • @@ -167,7 +167,7 @@

    Parameters

    value: undefined | MapGraphCoordinate

    • Returns void

    +
  • Defined in src/data-structures/graph/map-graph.ts:95

    • inEdgeMap

    +
  • Defined in src/data-structures/graph/directed-graph.ts:84

    • origin

  • set origin(value): void
  • @@ -194,7 +194,7 @@

    Parameters

    value: MapGraphCoordinate

    • Returns void

    +
  • Defined in src/data-structures/graph/map-graph.ts:85

    • outEdgeMap

    +
  • Defined in src/data-structures/graph/directed-graph.ts:78

    • vertices

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:111

    • Methods

    @@ -237,7 +237,7 @@

    Returns boolean

    +
  • Defined in src/data-structures/graph/directed-graph.ts:434

    • Protected _addVertexOnly

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:1019

    • Protected _getVertex

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:1028

    • Protected _getVertexId

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:1033

    • Protected _setInEdgeMap

    +
  • Defined in src/data-structures/graph/directed-graph.ts:467

    • Protected _setOutEdgeMap

    +
  • Defined in src/data-structures/graph/directed-graph.ts:463

    • Protected _setVertices

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:1037

    • addEdge

  • @@ -352,7 +352,7 @@
    Optional Returns boolean
    • +
  • Defined in src/data-structures/graph/abstract-graph.ts:222

    • addVertex

  • @@ -379,7 +379,7 @@
    Optional Returns boolean
    • +
  • Defined in src/data-structures/graph/abstract-graph.ts:170

    • bellmanFord

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:725

    • createEdge

    +
  • Defined in src/data-structures/graph/map-graph.ts:126

    • createVertex

    +
  • Defined in src/data-structures/graph/map-graph.ts:110

    • degreeOf

    +
  • Defined in src/data-structures/graph/directed-graph.ts:257

    • dijkstra

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:596

    • dijkstraWithoutHeap

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:456

    • edgeSet

    +
  • Defined in src/data-structures/graph/directed-graph.ts:377

    • edgesOf

    +
  • Defined in src/data-structures/graph/directed-graph.ts:284

    • floyd

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:851

    • getAllPathsBetween

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:268

    • getDestinations

    +
  • Defined in src/data-structures/graph/directed-graph.ts:312

    • getEdge

    +
  • Defined in src/data-structures/graph/directed-graph.ts:133

    • getEdgeDest

    +
  • Defined in src/data-structures/graph/directed-graph.ts:302

    • getEdgeSrc

    +
  • Defined in src/data-structures/graph/directed-graph.ts:293

    • getEndsOfEdge

    +
  • Defined in src/data-structures/graph/directed-graph.ts:414

    • getMinCostBetween

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:326

    • getMinPathBetween

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:384

    • getNeighbors

    +
  • Defined in src/data-structures/graph/directed-graph.ts:391

    • getPathSumWeight

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:304

    • getVertex

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:154

    • hasEdge

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:215

    • hasVertex

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:164

    • inDegreeOf

    +
  • Defined in src/data-structures/graph/directed-graph.ts:266

    • incomingEdgesOf

    +
  • Defined in src/data-structures/graph/directed-graph.ts:230

    • outDegreeOf

    +
  • Defined in src/data-structures/graph/directed-graph.ts:275

    • outgoingEdgesOf

    +
  • Defined in src/data-structures/graph/directed-graph.ts:244

    • removeAllVertices

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:199

    • removeEdge

    +
  • Defined in src/data-structures/graph/directed-graph.ts:183

    • removeEdgeSrcToDest

    +
  • Defined in src/data-structures/graph/directed-graph.ts:157

    • removeEdgesBetween

    +
  • Defined in src/data-structures/graph/directed-graph.ts:210

    • removeVertex

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:187

    • setEdgeWeight

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:251

    • tarjan

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:915

    • topologicalSort

    +
  • Defined in src/data-structures/graph/directed-graph.ts:335
    • diff --git a/docs/classes/MapVertex.html b/docs/classes/MapVertex.html index 652435c4..adc16184 100644 --- a/docs/classes/MapVertex.html +++ b/docs/classes/MapVertex.html @@ -27,7 +27,7 @@

    Hierarchy

    • MapVertex
    +
  • Defined in src/data-structures/graph/map-graph.ts:4
    • @@ -95,19 +95,19 @@

    Returns

    +
  • Defined in src/data-structures/graph/map-graph.ts:17

    • Properties

    Private _lat

    _lat: number
    +
  • Defined in src/data-structures/graph/map-graph.ts:23

    • Private _long

    _long: number
    +
  • Defined in src/data-structures/graph/map-graph.ts:33

    • Accessors

    @@ -118,7 +118,7 @@

    idReturns VertexId

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:28
  • set id(v): void
  • @@ -129,7 +129,7 @@
    v: Returns void
    • +
  • Defined in src/data-structures/graph/abstract-graph.ts:32

    • lat

  • set lat(value): void
  • @@ -147,7 +147,7 @@

    Parameters

    value: number

    • Returns void

    +
  • Defined in src/data-structures/graph/map-graph.ts:29

    • long

  • set long(value): void
  • @@ -165,7 +165,7 @@

    Parameters

    value: number

    • Returns void

    +
  • Defined in src/data-structures/graph/map-graph.ts:39

    • val

  • set val(value): void
  • @@ -185,7 +185,7 @@
    value: Returns void
    • +
  • Defined in src/data-structures/graph/abstract-graph.ts:42
    • diff --git a/docs/classes/Matrix2D.html b/docs/classes/Matrix2D.html index 034685ce..01676efb 100644 --- a/docs/classes/Matrix2D.html +++ b/docs/classes/Matrix2D.html @@ -20,7 +20,7 @@

    Hierarchy

    • Matrix2D
    +
  • Defined in src/data-structures/matrix/matrix2d.ts:10
    • @@ -75,14 +75,14 @@
    Optional Returns Matrix2D
    +
  • Defined in src/data-structures/matrix/matrix2d.ts:19

    • Properties

    Private Readonly _matrix

    _matrix: number[][]
    +
  • Defined in src/data-structures/matrix/matrix2d.ts:11

    • Accessors

    @@ -97,7 +97,7 @@

    Returns number

    +
  • Defined in src/data-structures/matrix/matrix2d.ts:57

    • toVector

      @@ -111,7 +111,7 @@

      Returns

    +
  • Defined in src/data-structures/matrix/matrix2d.ts:67

    • Static empty

      @@ -123,7 +123,7 @@

      Returns number

    +
  • Defined in src/data-structures/matrix/matrix2d.ts:36

    • Static identity

    +
  • Defined in src/data-structures/matrix/matrix2d.ts:44

    • Methods

    @@ -162,7 +162,7 @@

    Returns

    +
  • Defined in src/data-structures/matrix/matrix2d.ts:77

    • Static multiply

    +
  • Defined in src/data-structures/matrix/matrix2d.ts:110

    • Static multiplyByValue

    +
  • Defined in src/data-structures/matrix/matrix2d.ts:130

    • Static multiplyByVector

    +
  • Defined in src/data-structures/matrix/matrix2d.ts:146

    • Static rotate

    +
  • Defined in src/data-structures/matrix/matrix2d.ts:186

    • Static scale

    +
  • Defined in src/data-structures/matrix/matrix2d.ts:177

    • Static subtract

    +
  • Defined in src/data-structures/matrix/matrix2d.ts:94

    • Static translate

    +
  • Defined in src/data-structures/matrix/matrix2d.ts:203

    • Static view

    +
  • Defined in src/data-structures/matrix/matrix2d.ts:158
    • diff --git a/docs/classes/MatrixNTI2D.html b/docs/classes/MatrixNTI2D.html index e05e6d12..e3102c45 100644 --- a/docs/classes/MatrixNTI2D.html +++ b/docs/classes/MatrixNTI2D.html @@ -35,7 +35,7 @@

    Hierarchy

    • MatrixNTI2D
    +
  • Defined in src/data-structures/matrix/matrix.ts:9
    • @@ -86,14 +86,14 @@
    rowReturns MatrixNTI2D<T>
    +
  • Defined in src/data-structures/matrix/matrix.ts:17

    • Properties

    Private Readonly _matrix

    _matrix: T[][]
    +
  • Defined in src/data-structures/matrix/matrix.ts:10

    • Methods

    @@ -103,7 +103,7 @@

    toArray

    Returns T[][]

    +
  • Defined in src/data-structures/matrix/matrix.ts:24
    • diff --git a/docs/classes/MaxHeap.html b/docs/classes/MaxHeap.html index 07607ee6..7ee0aed4 100644 --- a/docs/classes/MaxHeap.html +++ b/docs/classes/MaxHeap.html @@ -27,7 +27,7 @@

    Hierarchy

    • MaxHeap
    +
  • Defined in src/data-structures/heap/max-heap.ts:17
    • @@ -87,7 +87,7 @@

    Returns

    +
  • Defined in src/data-structures/heap/max-heap.ts:25

    • Properties

    @@ -95,7 +95,7 @@

    Protected_pq: PriorityQueue<HeapItem<T>>

    +
  • Defined in src/data-structures/heap/max-heap.ts:18

    • Protected _priorityExtractor

    _priorityExtractor: ((val) => number)
    @@ -114,7 +114,7 @@
    val: Returns number
    +
  • Defined in src/data-structures/heap/heap.ts:69

    • Accessors

    @@ -125,7 +125,7 @@

    pqReturns PriorityQueue<HeapItem<T>>

    +
  • Defined in src/data-structures/heap/heap.ts:65

    • priorityExtractor

      @@ -145,7 +145,7 @@
      val: Returns number
    +
  • Defined in src/data-structures/heap/heap.ts:70

    • size

      @@ -158,7 +158,7 @@

      Returns number

    +
  • Defined in src/data-structures/heap/heap.ts:78

    • Methods

    @@ -191,7 +191,7 @@

    Throws

    if priority is not a valid number

    +
  • Defined in src/data-structures/heap/heap.ts:130

    • clear

    +
  • Defined in src/data-structures/heap/heap.ts:209

    • has

    +
  • Defined in src/data-structures/heap/heap.ts:160

    • isEmpty

    +
  • Defined in src/data-structures/heap/heap.ts:86

    • peek

  • The peek function returns the top item in the priority queue without removing it.

    @@ -270,7 +270,7 @@

    Returns undefined

    • +
  • Defined in src/data-structures/heap/heap.ts:91

  • The peek function returns the top item in the priority queue without removing it.

    @@ -285,7 +285,7 @@

    Returns null

    • +
  • Defined in src/data-structures/heap/heap.ts:92

    • peekLast

  • The peekLast function returns the last item in the heap.

    @@ -318,7 +318,7 @@

    Returns undefined

    • +
  • Defined in src/data-structures/heap/heap.ts:106

  • The peekLast function returns the last item in the heap.

    @@ -333,7 +333,7 @@

    Returns null

    • +
  • Defined in src/data-structures/heap/heap.ts:107

    • poll

  • The poll function returns the top item from a priority queue or null if the queue is empty.Removes and returns an val with the highest priority in the queue

    @@ -366,7 +366,7 @@

    Returns undefined

    • +
  • Defined in src/data-structures/heap/heap.ts:138

  • The poll function returns the top item from a priority queue or null if the queue is empty.Removes and returns an val with the highest priority in the queue

    @@ -381,7 +381,7 @@

    Returns null

    • +
  • Defined in src/data-structures/heap/heap.ts:139

    • sort

  • The function sorts the elements in the priority queue and returns either the sorted items or their values depending @@ -424,7 +424,7 @@

    Returns (

    • +
  • Defined in src/data-structures/heap/heap.ts:188

  • The function sorts the elements in the priority queue and returns either the sorted items or their values depending @@ -444,7 +444,7 @@

    Returns (

    • +
  • Defined in src/data-structures/heap/heap.ts:189

    • toArray

  • The toArray function returns an array of HeapItem<T> objects.

    @@ -477,7 +477,7 @@

    Returns (

    • +
  • Defined in src/data-structures/heap/heap.ts:173

  • The toArray function returns an array of HeapItem<T> objects.

    @@ -492,7 +492,7 @@

    Returns (

    • +
  • Defined in src/data-structures/heap/heap.ts:174
    • diff --git a/docs/classes/MaxPriorityQueue.html b/docs/classes/MaxPriorityQueue.html index 1611f79c..31c276a3 100644 --- a/docs/classes/MaxPriorityQueue.html +++ b/docs/classes/MaxPriorityQueue.html @@ -27,7 +27,7 @@

    Hierarchy

    • MaxPriorityQueue
    +
  • Defined in src/data-structures/priority-queue/max-priority-queue.ts:11
    • @@ -103,7 +103,7 @@

    Returns

    +
  • Defined in src/data-structures/priority-queue/max-priority-queue.ts:12

  • The constructor initializes a priority queue with an optional comparator function.

    @@ -126,7 +126,7 @@

    Returns

    • +
  • Defined in src/data-structures/priority-queue/max-priority-queue.ts:13

    • Properties

    @@ -134,13 +134,13 @@

    Protected_comparator: PriorityQueueComparator<T> = ...

    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:237

    • Protected _nodes

    _nodes: T[] = []
    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:27

    • Accessors

    @@ -151,7 +151,7 @@

    nodesReturns T[]

    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:29

    • size

    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:33

    • Methods

    @@ -185,7 +185,7 @@

    Returns (

    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:204

    • Protected _compare

    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:251

    • Protected _fix

    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:354

    • Protected _getComparedChild

    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:309

    • Protected _getLeft

    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:290

    • Protected _getParent

    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:281

    • Protected _getRight

    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:299

    • Protected _heapifyDown

    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:341

    • Protected _heapifyUp

    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:328

    • Protected _isValidIndex

    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:272

    • Protected _setNodes

    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:233

    • Protected _swap

    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:260

    • add

    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:73

    • clear

    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:135

    • clone

    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:153

    • getNodes

    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:64

    • has

    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:84

    • isEmpty

    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:128

    • isValid

    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:165

    • leaf

    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:118

    • peek

    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:93

    • poll

    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:101

    • sort

    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:188

    • toArray

    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:143

    • Static heapify

  • The function heapify creates a max priority queue from the given options and returns it.

    @@ -643,7 +643,7 @@

    Returns

    • +
  • Defined in src/data-structures/priority-queue/max-priority-queue.ts:34

    • Static isPriorityQueueified

    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:57
    • diff --git a/docs/classes/MinHeap.html b/docs/classes/MinHeap.html index f28f8aa0..e9a3cf23 100644 --- a/docs/classes/MinHeap.html +++ b/docs/classes/MinHeap.html @@ -27,7 +27,7 @@

    Hierarchy

    • MinHeap
    +
  • Defined in src/data-structures/heap/min-heap.ts:17
    • @@ -88,7 +88,7 @@

    Returns

    +
  • Defined in src/data-structures/heap/min-heap.ts:26

    • Properties

    @@ -96,7 +96,7 @@

    Protected_pq: PriorityQueue<HeapItem<T>>

    +
  • Defined in src/data-structures/heap/min-heap.ts:18

    • Protected _priorityExtractor

    _priorityExtractor: ((val) => number)
    @@ -115,7 +115,7 @@
    val: Returns number
    +
  • Defined in src/data-structures/heap/heap.ts:69

    • Accessors

    @@ -126,7 +126,7 @@

    pqReturns PriorityQueue<HeapItem<T>>

    +
  • Defined in src/data-structures/heap/heap.ts:65

    • priorityExtractor

      @@ -146,7 +146,7 @@
      val: Returns number
    +
  • Defined in src/data-structures/heap/heap.ts:70

    • size

    +
  • Defined in src/data-structures/heap/heap.ts:78

    • Methods

    @@ -192,7 +192,7 @@

    Throws

    if priority is not a valid number

    +
  • Defined in src/data-structures/heap/heap.ts:130

    • clear

    +
  • Defined in src/data-structures/heap/heap.ts:209

    • has

    +
  • Defined in src/data-structures/heap/heap.ts:160

    • isEmpty

    +
  • Defined in src/data-structures/heap/heap.ts:86

    • peek

  • The peek function returns the top item in the priority queue without removing it.

    @@ -271,7 +271,7 @@

    Returns undefined

    • +
  • Defined in src/data-structures/heap/heap.ts:91

  • The peek function returns the top item in the priority queue without removing it.

    @@ -286,7 +286,7 @@

    Returns null

    • +
  • Defined in src/data-structures/heap/heap.ts:92

    • peekLast

  • The peekLast function returns the last item in the heap.

    @@ -319,7 +319,7 @@

    Returns undefined

    • +
  • Defined in src/data-structures/heap/heap.ts:106

  • The peekLast function returns the last item in the heap.

    @@ -334,7 +334,7 @@

    Returns null

    • +
  • Defined in src/data-structures/heap/heap.ts:107

    • poll

  • The poll function returns the top item from a priority queue or null if the queue is empty.Removes and returns an val with the highest priority in the queue

    @@ -367,7 +367,7 @@

    Returns undefined

    • +
  • Defined in src/data-structures/heap/heap.ts:138

  • The poll function returns the top item from a priority queue or null if the queue is empty.Removes and returns an val with the highest priority in the queue

    @@ -382,7 +382,7 @@

    Returns null

    • +
  • Defined in src/data-structures/heap/heap.ts:139

    • sort

  • The function sorts the elements in the priority queue and returns either the sorted items or their values depending @@ -425,7 +425,7 @@

    Returns (

    • +
  • Defined in src/data-structures/heap/heap.ts:188

  • The function sorts the elements in the priority queue and returns either the sorted items or their values depending @@ -445,7 +445,7 @@

    Returns (

    • +
  • Defined in src/data-structures/heap/heap.ts:189

    • toArray

  • The toArray function returns an array of HeapItem<T> objects.

    @@ -478,7 +478,7 @@

    Returns (

    • +
  • Defined in src/data-structures/heap/heap.ts:173

  • The toArray function returns an array of HeapItem<T> objects.

    @@ -493,7 +493,7 @@

    Returns (

    • +
  • Defined in src/data-structures/heap/heap.ts:174
    • diff --git a/docs/classes/MinPriorityQueue.html b/docs/classes/MinPriorityQueue.html index 54d27a41..74f533b2 100644 --- a/docs/classes/MinPriorityQueue.html +++ b/docs/classes/MinPriorityQueue.html @@ -27,7 +27,7 @@

    Hierarchy

    • MinPriorityQueue
    +
  • Defined in src/data-structures/priority-queue/min-priority-queue.ts:11
    • @@ -103,7 +103,7 @@

    Returns

    +
  • Defined in src/data-structures/priority-queue/min-priority-queue.ts:12

  • The constructor initializes a priority queue with an optional comparator function.

    @@ -126,7 +126,7 @@

    Returns

    • +
  • Defined in src/data-structures/priority-queue/min-priority-queue.ts:13

    • Properties

    @@ -134,13 +134,13 @@

    Protected_comparator: PriorityQueueComparator<T> = ...

    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:237

    • Protected _nodes

    _nodes: T[] = []
    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:27

    • Accessors

    @@ -151,7 +151,7 @@

    nodesReturns T[]

    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:29

    • size

    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:33

    • Methods

    @@ -185,7 +185,7 @@

    Returns (

    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:204

    • Protected _compare

    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:251

    • Protected _fix

    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:354

    • Protected _getComparedChild

    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:309

    • Protected _getLeft

    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:290

    • Protected _getParent

    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:281

    • Protected _getRight

    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:299

    • Protected _heapifyDown

    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:341

    • Protected _heapifyUp

    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:328

    • Protected _isValidIndex

    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:272

    • Protected _setNodes

    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:233

    • Protected _swap

    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:260

    • add

    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:73

    • clear

    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:135

    • clone

    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:153

    • getNodes

    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:64

    • has

    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:84

    • isEmpty

    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:128

    • isValid

    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:165

    • leaf

    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:118

    • peek

    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:93

    • poll

    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:101

    • sort

    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:188

    • toArray

    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:143

    • Static heapify

  • The function heapify creates a new MinPriorityQueue instance and sets the comparator function based on the options @@ -645,7 +645,7 @@

    Returns

    • +
  • Defined in src/data-structures/priority-queue/min-priority-queue.ts:34

    • Static isPriorityQueueified

    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:57
    • diff --git a/docs/classes/Navigator.html b/docs/classes/Navigator.html index efc749bb..3d0a2599 100644 --- a/docs/classes/Navigator.html +++ b/docs/classes/Navigator.html @@ -25,7 +25,7 @@

    Hierarchy

    • Navigator
    +
  • Defined in src/data-structures/matrix/navigator.ts:28
    • @@ -75,29 +75,29 @@
    -: Returns Navigator<T>
    +
  • Defined in src/data-structures/matrix/navigator.ts:40

    • Properties

    Private Readonly _VISITED

    _VISITED: T
    +
  • Defined in src/data-structures/matrix/navigator.ts:33

    • Private _character

    _character: Character
    +
  • Defined in src/data-structures/matrix/navigator.ts:32

    • Private Readonly _cur

    _cur: [number, number]
    +
  • Defined in src/data-structures/matrix/navigator.ts:31

    • Private Readonly _matrix

    _matrix: T[][]
    +
  • Defined in src/data-structures/matrix/navigator.ts:30

    • onMove

    onMove: ((cur) => void)
    @@ -115,7 +115,7 @@

    Parameters

    cur: [number, number]

    Returns void

    +
  • Defined in src/data-structures/matrix/navigator.ts:29

    • Methods

    @@ -138,7 +138,7 @@

    Returns boolean

    +
  • Defined in src/data-structures/matrix/navigator.ts:71

    • move

    +
  • Defined in src/data-structures/matrix/navigator.ts:101

    • start

    +
  • Defined in src/data-structures/matrix/navigator.ts:54
    • diff --git a/docs/classes/ObjectDeque.html b/docs/classes/ObjectDeque.html index f0872d44..7d6f6463 100644 --- a/docs/classes/ObjectDeque.html +++ b/docs/classes/ObjectDeque.html @@ -25,7 +25,7 @@

    Hierarchy

    • ObjectDeque
    +
  • Defined in src/data-structures/queue/deque.ts:17
    • @@ -83,24 +83,24 @@

    Parameters

    Optional capacity: number

    Returns ObjectDeque<T>

    +
  • Defined in src/data-structures/queue/deque.ts:18

    • Properties

    Private _capacity

    _capacity: number = Number.MAX_SAFE_INTEGER
    +
  • Defined in src/data-structures/queue/deque.ts:28

    • Private _first

    _first: number = -1
    +
  • Defined in src/data-structures/queue/deque.ts:38

    • Private _last

    _last: number = -1
    +
  • Defined in src/data-structures/queue/deque.ts:48

    • Private _nodes

    _nodes: {
        [key: number]: T;
    } = {}
    @@ -110,12 +110,12 @@

    Type declaration

  • [key: number]: T
    • +
  • Defined in src/data-structures/queue/deque.ts:22

    • Private _size

    _size: number = 0
    +
  • Defined in src/data-structures/queue/deque.ts:58

    • Accessors

    @@ -125,7 +125,7 @@

    capacity

    Returns number

     +
  • Defined in src/data-structures/queue/deque.ts:30
  • set capacity(value): void
  • @@ -135,7 +135,7 @@

    Parameters

    value: number

    • Returns void

    +
  • Defined in src/data-structures/queue/deque.ts:34

    • first

  • set first(value): void
  • @@ -153,7 +153,7 @@

    Parameters

    value: number

    • Returns void

    +
  • Defined in src/data-structures/queue/deque.ts:44

    • last

  • set last(value): void
  • @@ -171,7 +171,7 @@

    Parameters

    value: number

    • Returns void

    +
  • Defined in src/data-structures/queue/deque.ts:54

    • nodes

      @@ -182,7 +182,7 @@

      Returns {
      [p: number]: T

    +
  • Defined in src/data-structures/queue/deque.ts:24

    • size

    +
  • Defined in src/data-structures/queue/deque.ts:60

    • Methods

    @@ -208,7 +208,7 @@
    value: [p: number]: T

    Returns void

    +
  • Defined in src/data-structures/queue/deque.ts:159

    • Protected _setSize

      @@ -221,7 +221,7 @@

      Parameters

      value: number

    Returns void

    +
  • Defined in src/data-structures/queue/deque.ts:163

    • addFirst

    +
  • Defined in src/data-structures/queue/deque.ts:69

    • addLast

    +
  • Defined in src/data-structures/queue/deque.ts:85

    • get

    +
  • Defined in src/data-structures/queue/deque.ts:147

    • isEmpty

    +
  • Defined in src/data-structures/queue/deque.ts:155

    • peekFirst

    +
  • Defined in src/data-structures/queue/deque.ts:114

    • peekLast

    +
  • Defined in src/data-structures/queue/deque.ts:136

    • pollFirst

    +
  • Defined in src/data-structures/queue/deque.ts:101

    • pollLast

    +
  • Defined in src/data-structures/queue/deque.ts:122
    • diff --git a/docs/classes/Pair.html b/docs/classes/Pair.html index bbe92585..e14745ff 100644 --- a/docs/classes/Pair.html +++ b/docs/classes/Pair.html @@ -20,7 +20,7 @@

    Hierarchy

    • Pair
    +
  • Defined in src/data-structures/hash/pair.ts:1
    • diff --git a/docs/classes/PriorityQueue.html b/docs/classes/PriorityQueue.html index d19e0a85..8ccb3194 100644 --- a/docs/classes/PriorityQueue.html +++ b/docs/classes/PriorityQueue.html @@ -28,7 +28,7 @@

    Hierarchy

  • MinPriorityQueue
  • MaxPriorityQueue
    • +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:10
    • @@ -103,19 +103,19 @@
    options: Returns PriorityQueue<T>
    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:16

    • Properties

    Protected Readonly _comparator

    _comparator: PriorityQueueComparator<T> = ...
    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:237

    • Protected _nodes

    _nodes: T[] = []
    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:27

    • Accessors

    @@ -125,7 +125,7 @@

    nodes

    Returns T[]

    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:29

    • size

    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:33

    • Methods

    @@ -157,7 +157,7 @@

    Returns (

    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:204

    • Protected _compare

      @@ -184,7 +184,7 @@

      Returns boolean

    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:251

    • Protected _fix

    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:354

    • Protected _getComparedChild

      @@ -217,7 +217,7 @@

      Returns number

    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:309

    • Protected _getLeft

    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:290

    • Protected _getParent

    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:281

    • Protected _getRight

    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:299

    • Protected _heapifyDown

    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:341

    • Protected _heapifyUp

    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:328

    • Protected _isValidIndex

    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:272

    • Protected _setNodes

      @@ -351,7 +351,7 @@

      Parameters

      value: T[]

    Returns void

    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:233

    • Protected _swap

    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:260

    • add

    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:73

    • clear

    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:135

    • clone

    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:153

    • getNodes

    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:64

    • has

    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:84

    • isEmpty

    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:128

    • isValid

    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:165

    • leaf

    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:118

    • peek

    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:93

    • poll

    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:101

    • sort

    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:188

    • toArray

    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:143

    • Static heapify

    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:44

    • Static isPriorityQueueified

    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:57
    • diff --git a/docs/classes/Queue.html b/docs/classes/Queue.html index 46388c5f..a4d47b1f 100644 --- a/docs/classes/Queue.html +++ b/docs/classes/Queue.html @@ -25,7 +25,7 @@

    Hierarchy

    • Queue
    +
  • Defined in src/data-structures/queue/queue.ts:34
    • @@ -89,19 +89,19 @@
    Optional Returns Queue<T>
    +
  • Defined in src/data-structures/queue/queue.ts:41

    • Properties

    Private _nodes

    _nodes: T[]
    +
  • Defined in src/data-structures/queue/queue.ts:46

    • Private _offset

    _offset: number
    +
  • Defined in src/data-structures/queue/queue.ts:56

    • Accessors

    @@ -111,7 +111,7 @@

    nodes

    Returns T[]

     +
  • Defined in src/data-structures/queue/queue.ts:48
  • set nodes(value): void
  • @@ -121,7 +121,7 @@

    Parameters

    value: T[]

    • Returns void

    +
  • Defined in src/data-structures/queue/queue.ts:52

    • offset

  • set offset(value): void
  • @@ -139,7 +139,7 @@

    Parameters

    value: number

    • Returns void

    +
  • Defined in src/data-structures/queue/queue.ts:62

    • size

      @@ -151,7 +151,7 @@

      Returns number

    +
  • Defined in src/data-structures/queue/queue.ts:70

    • Methods

    @@ -161,7 +161,7 @@

    [iterator]

    Returns Generator<T, void, unknown>

    +
  • Defined in src/data-structures/queue/queue.ts:186

    • clear

    +
  • Defined in src/data-structures/queue/queue.ts:173

    • clone

    +
  • Defined in src/data-structures/queue/queue.ts:182

    • dequeue

    +
  • Defined in src/data-structures/queue/queue.ts:146

    • enqueue

    +
  • Defined in src/data-structures/queue/queue.ts:138

    • getAt

      @@ -228,7 +228,7 @@

      Parameters

      index: number

    Returns undefined | T

    +
  • Defined in src/data-structures/queue/queue.ts:150

    • isEmpty

    +
  • Defined in src/data-structures/queue/queue.ts:158

    • peek

    +
  • Defined in src/data-structures/queue/queue.ts:121

    • peekLast

    +
  • Defined in src/data-structures/queue/queue.ts:130

    • push

    +
  • Defined in src/data-structures/queue/queue.ts:91

    • shift

    +
  • Defined in src/data-structures/queue/queue.ts:101

    • toArray

    +
  • Defined in src/data-structures/queue/queue.ts:166

    • Static fromArray

    +
  • Defined in src/data-structures/queue/queue.ts:82
    • diff --git a/docs/classes/RBTree.html b/docs/classes/RBTree.html index ee2d0065..b342ce50 100644 --- a/docs/classes/RBTree.html +++ b/docs/classes/RBTree.html @@ -31,7 +31,7 @@

    Implements

    +
  • Defined in src/data-structures/binary-tree/rb-tree.ts:58
    • @@ -126,7 +126,7 @@
    Optional Returns RBTree<N>
    +
  • Defined in src/data-structures/binary-tree/rb-tree.ts:59

    • Properties

    @@ -134,7 +134,7 @@

    Protected_comparator: BSTComparator = ...

    +
  • Defined in src/data-structures/binary-tree/bst.ts:519

    • Accessors

    @@ -146,7 +146,7 @@

    Returns src/data-structures/binary-tree/abstract-binary-tree.ts:164

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:168

    • root

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:156

    • size

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:162

    • visitedId

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:174

    • visitedLeftSum

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:192

    • visitedNode

      @@ -196,7 +196,7 @@

      Returns src/data-structures/binary-tree/abstract-binary-tree.ts:182

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:186

    • visitedVal

      @@ -206,7 +206,7 @@

      Returns src/data-structures/binary-tree/abstract-binary-tree.ts:176

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:180

    • Methods

    @@ -222,7 +222,7 @@

    Returns numberImplementation of IRBTree.BFS

    Inherited from BST.BFS

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:929

  • Performs a breadth-first search (BFS) on a binary tree, accumulating properties of each node based on the specified property name.

    @@ -241,7 +241,7 @@

    Returns numberImplementation of IRBTree.BFS

    Inherited from BST.BFS

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:936

  • Performs a breadth-first search (BFS) on a binary tree, accumulating the 'val' property of each node.

    @@ -260,7 +260,7 @@

    Returns IRBTree.BFS

    Inherited from BST.BFS

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:943

  • Performs a breadth-first search (BFS) on a binary tree, accumulating nodes themselves.

    @@ -279,7 +279,7 @@

    Returns IRBTree.BFS

    Inherited from BST.BFS

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:950

    • DFS

  • Performs a depth-first search (DFS) traversal on a binary tree and accumulates properties of each node based on the specified property name.

    @@ -317,7 +317,7 @@

    Returns numberImplementation of IRBTree.DFS

    Inherited from BST.DFS

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:988

  • Performs a depth-first search (DFS) traversal on a binary tree and accumulates the 'val' property of each node.

    @@ -341,7 +341,7 @@

    Returns IRBTree.DFS

    Inherited from BST.DFS

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:996

  • Performs a depth-first search (DFS) traversal on a binary tree and accumulates nodes themselves.

    @@ -365,7 +365,7 @@

    Returns IRBTree.DFS

    Inherited from BST.DFS

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1004

    • DFSIterative

  • Performs an iterative depth-first search (DFS) traversal on a binary tree and accumulates properties of each node based on the specified property name.

    @@ -403,7 +403,7 @@

    Returns numberImplementation of IRBTree.DFSIterative

    Inherited from BST.DFSIterative

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1055

  • Performs an iterative depth-first search (DFS) traversal on a binary tree and accumulates the 'val' property of each node.

    @@ -427,7 +427,7 @@

    Returns IRBTree.DFSIterative

    Inherited from BST.DFSIterative

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1063

  • Performs an iterative depth-first search (DFS) traversal on a binary tree and accumulates nodes themselves.

    @@ -451,7 +451,7 @@

    Returns IRBTree.DFSIterative

    Inherited from BST.DFSIterative

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1071

    • Protected _accumulatedByPropertyName

      @@ -478,7 +478,7 @@

      Returns void

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1584

    • Protected _addTo

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1438

    • Protected _clearResults

      @@ -521,7 +521,7 @@

      Returns void

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1526

    • Protected _compare

    +
  • Defined in src/data-structures/binary-tree/bst.ts:529

    • Protected _getResultByPropertyName

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1615

    • Protected _pushByPropertyNameStopOrNot

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1548

    • Protected _setLoopType

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1466

    • Protected _setRoot

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1507

    • Protected _setSize

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1518

    • Protected _setVisitedId

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1474

    • Protected _setVisitedLeftSum

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1498

    • Protected _setVisitedNode

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1490

    • Protected _setVisitedVal

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1482

    • add

    +
  • Defined in src/data-structures/binary-tree/bst.ts:58

    • addMany

    +
  • Defined in src/data-structures/binary-tree/bst.ts:134

    • allGreaterNodesAdd

    +
  • Defined in src/data-structures/binary-tree/bst.ts:370

    • clear

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:227

    • createNode

    +
  • Defined in src/data-structures/binary-tree/rb-tree.ts:63

    • fill

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:345

    • get

    +
  • Defined in src/data-structures/binary-tree/bst.ts:211

    • getDepth

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:412

    • getHeight

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:430

    • getLeftMost

  • The function getLeftMost returns the leftmost node in a binary tree, starting from a specified node or the root if @@ -1054,7 +1054,7 @@

    Returns IRBTree.getLeftMost

    Inherited from BST.getLeftMost

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:651

    • getMinHeight

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:479

    • getNodes

    +
  • Defined in src/data-structures/binary-tree/bst.ts:240

    • getPathToRoot

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:615

    • getPredecessor

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1284

    • getRightMost

  • The getRightMost function returns the rightmost node in a binary tree, either recursively or iteratively using tail @@ -1207,7 +1207,7 @@

    Returns IRBTree.getRightMost

    Inherited from BST.getRightMost

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:705

    • getSubTreeSize

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:789

    • has

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:582

    • isAVLBalanced

    +
  • Defined in src/data-structures/binary-tree/bst.ts:475

    • isBST

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:779

    • isEmpty

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:237

    • isPerfectlyBalanced

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:529

    • isSubtreeBST

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:745

    • lastKey

    +
  • Defined in src/data-structures/binary-tree/bst.ts:223

    • lesserSum

    +
  • Defined in src/data-structures/binary-tree/bst.ts:293

    • levelIterative

  • Performs a level-order traversal on a binary tree starting from the specified node and accumulates properties of each node based on the specified property name.

    @@ -1440,7 +1440,7 @@

    Returns numberImplementation of IRBTree.levelIterative

    Inherited from BST.levelIterative

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1138

  • Performs a level-order traversal on a binary tree starting from the specified node and accumulates the 'val' property of each node.

    @@ -1464,7 +1464,7 @@

    Returns IRBTree.levelIterative

    Inherited from BST.levelIterative

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1146

  • Performs a level-order traversal on a binary tree starting from the specified node and accumulates nodes themselves.

    @@ -1488,7 +1488,7 @@

    Returns IRBTree.levelIterative

    Inherited from BST.levelIterative

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1154

    • listLevels

  • Collects nodes from a binary tree by a specified property and organizes them into levels.

    @@ -1530,7 +1530,7 @@

    Returns numberImplementation of IRBTree.listLevels

    Inherited from BST.listLevels

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1205

  • Collects nodes from a binary tree by a specified property and organizes them into levels.

    @@ -1554,7 +1554,7 @@

    Returns IRBTree.listLevels

    Inherited from BST.listLevels

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1213

  • Collects nodes from a binary tree by a specified property and organizes them into levels.

    @@ -1578,7 +1578,7 @@

    Returns IRBTree.listLevels

    Inherited from BST.listLevels

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1221

    • morris

  • Performs an in-order, pre-order, or post-order traversal on a binary tree using the Morris traversal algorithm and accumulates properties of each node based on the specified property name.

    @@ -1616,7 +1616,7 @@

    Returns numberImplementation of IRBTree.morris

    Inherited from BST.morris

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1315

  • Performs an in-order, pre-order, or post-order traversal on a binary tree using the Morris traversal algorithm and accumulates the 'val' property of each node.

    @@ -1640,7 +1640,7 @@

    Returns IRBTree.morris

    Inherited from BST.morris

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1323

  • Performs an in-order, pre-order, or post-order traversal on a binary tree using the Morris traversal algorithm and accumulates nodes themselves.

    @@ -1664,7 +1664,7 @@

    Returns IRBTree.morris

    Inherited from BST.morris

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1331

    • perfectlyBalance

    +
  • Defined in src/data-structures/binary-tree/bst.ts:434

    • remove

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:360

    • subTreeAdd

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:882

    • subTreeSum

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:826

    • swapLocation

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:205
    • diff --git a/docs/classes/RBTreeNode.html b/docs/classes/RBTreeNode.html index 808c4cf9..22fad83a 100644 --- a/docs/classes/RBTreeNode.html +++ b/docs/classes/RBTreeNode.html @@ -33,7 +33,7 @@

    Implements

    +
  • Defined in src/data-structures/binary-tree/rb-tree.ts:5
    • @@ -84,14 +84,14 @@
    color: Returns RBTreeNode<T, NEIGHBOR>
    +
  • Defined in src/data-structures/binary-tree/rb-tree.ts:9

    • Properties

    Private _color

    _color: RBColor
    +
  • Defined in src/data-structures/binary-tree/rb-tree.ts:14

    • Accessors

    @@ -101,7 +101,7 @@

    color

    Returns RBColor

    +
  • Defined in src/data-structures/binary-tree/rb-tree.ts:16
  • set color(value): void
  • @@ -111,7 +111,7 @@

    Parameters

    value: RBColor

    • Returns void

    +
  • Defined in src/data-structures/binary-tree/rb-tree.ts:20

    • familyPosition

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:110

    • height

  • set height(v): void
  • @@ -147,7 +147,7 @@

    Returns voidImplementation of IRBTreeNode.height

    Inherited from BSTNode.height

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:102

    • id

  • set id(v): void
  • @@ -169,7 +169,7 @@

    Returns voidImplementation of IRBTreeNode.id

    Inherited from BSTNode.id

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:46

    • left

  • set left(v): void
  • @@ -191,7 +191,7 @@

    Returns voidImplementation of IRBTreeNode.left

    Inherited from BSTNode.left

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:66

    • parent

  • set parent(v): void
  • @@ -213,7 +213,7 @@

    Returns voidImplementation of IRBTreeNode.parent

    Inherited from BSTNode.parent

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:92

    • right

  • set right(v): void
  • @@ -235,7 +235,7 @@

    Returns voidImplementation of IRBTreeNode.right

    Inherited from BSTNode.right

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:79

    • val

  • set val(value): void
  • @@ -257,7 +257,7 @@

    Returns voidImplementation of IRBTreeNode.val

    Inherited from BSTNode.val

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:56
    • diff --git a/docs/classes/SegmentTree.html b/docs/classes/SegmentTree.html index 61afd381..925740eb 100644 --- a/docs/classes/SegmentTree.html +++ b/docs/classes/SegmentTree.html @@ -20,7 +20,7 @@

    Hierarchy

    • SegmentTree
    +
  • Defined in src/data-structures/binary-tree/segment-tree.ts:79
    • @@ -87,29 +87,29 @@
    Optional Returns SegmentTree
    +
  • Defined in src/data-structures/binary-tree/segment-tree.ts:89

    • Properties

    Private _end

    _end: number
    +
  • Defined in src/data-structures/binary-tree/segment-tree.ts:109

    • Private _root

    _root: null | SegmentTreeNode
    +
  • Defined in src/data-structures/binary-tree/segment-tree.ts:115

    • Private _start

    _start: number = 0
    +
  • Defined in src/data-structures/binary-tree/segment-tree.ts:104

    • Private _values

    _values: number[] = []
    +
  • Defined in src/data-structures/binary-tree/segment-tree.ts:98

    • Accessors

    @@ -119,7 +119,7 @@

    end

    Returns number

    +
  • Defined in src/data-structures/binary-tree/segment-tree.ts:111

    • root

    +
  • Defined in src/data-structures/binary-tree/segment-tree.ts:117

    • start

    +
  • Defined in src/data-structures/binary-tree/segment-tree.ts:105

    • values

    +
  • Defined in src/data-structures/binary-tree/segment-tree.ts:100

    • Methods

    @@ -158,7 +158,7 @@

    Parameters

    value: number

    Returns void

    +
  • Defined in src/data-structures/binary-tree/segment-tree.ts:235

    • Protected _setRoot

    Returns void

    +
  • Defined in src/data-structures/binary-tree/segment-tree.ts:239

    • Protected _setStart

      @@ -184,7 +184,7 @@

      Parameters

      value: number

    Returns void

    +
  • Defined in src/data-structures/binary-tree/segment-tree.ts:231

    • Protected _setValues

      @@ -197,7 +197,7 @@

      Parameters

      value: number[]

    Returns void

    +
  • Defined in src/data-structures/binary-tree/segment-tree.ts:227

    • build

    +
  • Defined in src/data-structures/binary-tree/segment-tree.ts:130

    • querySumByRange

    +
  • Defined in src/data-structures/binary-tree/segment-tree.ts:189

    • updateNode

    +
  • Defined in src/data-structures/binary-tree/segment-tree.ts:153
    • diff --git a/docs/classes/SegmentTreeNode.html b/docs/classes/SegmentTreeNode.html index f1479755..5f912f78 100644 --- a/docs/classes/SegmentTreeNode.html +++ b/docs/classes/SegmentTreeNode.html @@ -20,7 +20,7 @@

    Hierarchy

    • SegmentTreeNode
    +
  • Defined in src/data-structures/binary-tree/segment-tree.ts:11
    • @@ -68,39 +68,39 @@
    sum: Optional val: null | number

    Returns SegmentTreeNode

    +
  • Defined in src/data-structures/binary-tree/segment-tree.ts:12

    • Properties

    Private _end

    _end: number = 0
    +
  • Defined in src/data-structures/binary-tree/segment-tree.ts:28

    • Private _left

    _left: null | SegmentTreeNode = null
    +
  • Defined in src/data-structures/binary-tree/segment-tree.ts:58

    • Private _right

    _right: null | SegmentTreeNode = null
    +
  • Defined in src/data-structures/binary-tree/segment-tree.ts:68

    • Private _start

    _start: number = 0
    +
  • Defined in src/data-structures/binary-tree/segment-tree.ts:19

    • Private _sum

    _sum: number = 0
    +
  • Defined in src/data-structures/binary-tree/segment-tree.ts:48

    • Private _val

    _val: null | number = null
    +
  • Defined in src/data-structures/binary-tree/segment-tree.ts:38

    • Accessors

    @@ -110,7 +110,7 @@

    end

    Returns number

     +
  • Defined in src/data-structures/binary-tree/segment-tree.ts:30
  • set end(v): void
  • @@ -120,7 +120,7 @@

    Parameters

    v: number

    • Returns void

    +
  • Defined in src/data-structures/binary-tree/segment-tree.ts:34

    • left

  • set left(v): void
  • @@ -138,7 +138,7 @@

    Parameters

    v: null | SegmentTreeNode

    • Returns void

    +
  • Defined in src/data-structures/binary-tree/segment-tree.ts:64

    • right

  • set right(v): void
  • @@ -156,7 +156,7 @@

    Parameters

    v: null | SegmentTreeNode

    • Returns void

    +
  • Defined in src/data-structures/binary-tree/segment-tree.ts:74

    • start

  • set start(v): void
  • @@ -174,7 +174,7 @@

    Parameters

    v: number

    • Returns void

    +
  • Defined in src/data-structures/binary-tree/segment-tree.ts:24

    • sum

  • set sum(v): void
  • @@ -192,7 +192,7 @@

    Parameters

    v: number

    • Returns void

    +
  • Defined in src/data-structures/binary-tree/segment-tree.ts:54

    • val

  • set val(v): void
  • @@ -210,7 +210,7 @@

    Parameters

    v: null | number

    • Returns void

    +
  • Defined in src/data-structures/binary-tree/segment-tree.ts:44
    • diff --git a/docs/classes/SinglyLinkedList.html b/docs/classes/SinglyLinkedList.html index 07f150b9..745e9cc2 100644 --- a/docs/classes/SinglyLinkedList.html +++ b/docs/classes/SinglyLinkedList.html @@ -27,7 +27,7 @@

    Hierarchy

    +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:40
    • @@ -91,24 +91,24 @@

    T = Returns SinglyLinkedList<T>

    +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:44

    • Properties

    Private _head

    _head: null | SinglyLinkedListNode<T>
    +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:50

    • Private _length

    _length: number
    +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:70

    • Private _tail

    _tail: null | SinglyLinkedListNode<T>
    +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:60

    • Accessors

    @@ -118,7 +118,7 @@

    head

    Returns null | SinglyLinkedListNode<T>

    +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:52
  • set head(value): void
  • @@ -128,7 +128,7 @@

    Parameters

    value: null | SinglyLinkedListNode<T>

    • Returns void

    +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:56

    • length

    +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:72

    • tail

  • set tail(value): void
  • @@ -154,7 +154,7 @@

    Parameters

    value: null | SinglyLinkedListNode<T>

    • Returns void

    +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:66

    • Methods

    @@ -164,7 +164,7 @@

    [iterator]

    Returns Generator<T, void, unknown>

    +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:493

    • clear

    +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:300

    • countOccurrences

      @@ -195,7 +195,7 @@

      Returns number

    +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:479

    • delete

  • The delete function removes a node with a specific value from a singly linked list.

    @@ -236,7 +236,7 @@

    Returns boolean

    • +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:218

    • deleteAt

    +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:205

    • find

    +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:348

    • findNode

    +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:387

    • getAt

    +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:174

    • getLength

    +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:90

    • getNodeAt

    +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:190

    • indexOf

    +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:365

    • insertAfter

  • The insertAfter function inserts a new node with a given value after an existing node in a singly linked list.

    @@ -437,7 +437,7 @@

    Returns boolean

    • +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:441

    • insertAt

    +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:269

    • insertBefore

  • The insertBefore function inserts a new value before an existing value in a singly linked list.

    @@ -508,7 +508,7 @@

    Returns boolean

    • +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:401

    • isEmpty

    +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:293

    • pop

    +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:117

    • push

    +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:99

    • reverse

    +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:324

    • shift

    +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:142

    • toArray

    +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:310

    • unshift

    +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:155

    • Static fromArray

    +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:82
    • diff --git a/docs/classes/SinglyLinkedListNode.html b/docs/classes/SinglyLinkedListNode.html index c7b47c1a..6f835391 100644 --- a/docs/classes/SinglyLinkedListNode.html +++ b/docs/classes/SinglyLinkedListNode.html @@ -35,7 +35,7 @@

    Hierarchy

    • SinglyLinkedListNode
    +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:8
    • @@ -81,19 +81,19 @@
    val: Returns SinglyLinkedListNode<T>
    +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:14

    • Properties

    Private _next

    _next: null | SinglyLinkedListNode<T>
    +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:29

    • Private _val

    _val: T
    +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:19

    • Accessors

    @@ -103,7 +103,7 @@

    next

    Returns null | SinglyLinkedListNode<T>

    +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:31
  • set next(value): void
  • @@ -113,7 +113,7 @@

    Parameters

    value: null | SinglyLinkedListNode<T>

    • Returns void

    +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:35

    • val

  • set val(value): void
  • @@ -131,7 +131,7 @@

    Parameters

    value: T

    • Returns void

    +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:25
    • diff --git a/docs/classes/SkipLinkedList.html b/docs/classes/SkipLinkedList.html index 10a905e3..57df1949 100644 --- a/docs/classes/SkipLinkedList.html +++ b/docs/classes/SkipLinkedList.html @@ -20,7 +20,7 @@

    Hierarchy

    • SkipLinkedList
    +
  • Defined in src/data-structures/linked-list/skip-linked-list.ts:1
    • diff --git a/docs/classes/SplayTree.html b/docs/classes/SplayTree.html index e690e6a6..79906db1 100644 --- a/docs/classes/SplayTree.html +++ b/docs/classes/SplayTree.html @@ -20,7 +20,7 @@

    Hierarchy

    • SplayTree
    +
  • Defined in src/data-structures/binary-tree/splay-tree.ts:1
    • diff --git a/docs/classes/Stack.html b/docs/classes/Stack.html index eb450518..b08674d8 100644 --- a/docs/classes/Stack.html +++ b/docs/classes/Stack.html @@ -31,7 +31,7 @@

    Hierarchy

    • Stack
    +
  • Defined in src/data-structures/stack/stack.ts:6
    • @@ -84,14 +84,14 @@
    Optional Returns Stack<T>
    +
  • Defined in src/data-structures/stack/stack.ts:15

    • Properties

    Protected _elements

    _elements: T[]
    +
  • Defined in src/data-structures/stack/stack.ts:7

    • Methods

    @@ -104,7 +104,7 @@

    clearReturns void

    +
  • Defined in src/data-structures/stack/stack.ts:87

    • clone

      @@ -116,7 +116,7 @@

      Returns

    +
  • Defined in src/data-structures/stack/stack.ts:95

    • isEmpty

      @@ -128,7 +128,7 @@

      Returns boolean

    +
  • Defined in src/data-structures/stack/stack.ts:33

    • peek

      @@ -140,7 +140,7 @@

      Returns null

    +
  • Defined in src/data-structures/stack/stack.ts:49

    • pop

    +
  • Defined in src/data-structures/stack/stack.ts:70

    • push

    +
  • Defined in src/data-structures/stack/stack.ts:60

    • size

    +
  • Defined in src/data-structures/stack/stack.ts:41

    • toArray

    +
  • Defined in src/data-structures/stack/stack.ts:80

    • Static fromArray

    +
  • Defined in src/data-structures/stack/stack.ts:25
    • diff --git a/docs/classes/TreeMap.html b/docs/classes/TreeMap.html index 836ff868..15415d1c 100644 --- a/docs/classes/TreeMap.html +++ b/docs/classes/TreeMap.html @@ -20,7 +20,7 @@

    Hierarchy

    • TreeMap
    +
  • Defined in src/data-structures/hash/tree-map.ts:1
    • diff --git a/docs/classes/TreeMultiset.html b/docs/classes/TreeMultiset.html index 3d60a079..22260b45 100644 --- a/docs/classes/TreeMultiset.html +++ b/docs/classes/TreeMultiset.html @@ -35,7 +35,7 @@

    Implements

    +
  • Defined in src/data-structures/binary-tree/tree-multiset.ts:46
    • @@ -159,7 +159,7 @@

    Returns

    +
  • Defined in src/data-structures/binary-tree/tree-multiset.ts:56

    • Properties

    @@ -167,12 +167,12 @@

    Protected_comparator: BSTComparator = ...

    +
  • Defined in src/data-structures/binary-tree/bst.ts:519

    • Private _count

    _count: number = 0
    +
  • Defined in src/data-structures/binary-tree/tree-multiset.ts:60

    • Accessors

    @@ -182,7 +182,7 @@

    count

    Returns number

    +
  • Defined in src/data-structures/binary-tree/tree-multiset.ts:62

    • loopType

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:168

    • root

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:156

    • size

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:162

    • visitedId

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:174

    • visitedLeftSum

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:192

    • visitedNode

      @@ -242,7 +242,7 @@

      Returns src/data-structures/binary-tree/abstract-binary-tree.ts:182

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:186

    • visitedVal

      @@ -252,7 +252,7 @@

      Returns src/data-structures/binary-tree/abstract-binary-tree.ts:176

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:180

    • Methods

    @@ -268,7 +268,7 @@

    Returns numberImplementation of ITreeMultiset.BFS

    Inherited from AVLTree.BFS

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:929

  • Performs a breadth-first search (BFS) on a binary tree, accumulating properties of each node based on the specified property name.

    @@ -287,7 +287,7 @@

    Returns numberImplementation of ITreeMultiset.BFS

    Inherited from AVLTree.BFS

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:936

  • Performs a breadth-first search (BFS) on a binary tree, accumulating the 'val' property of each node.

    @@ -306,7 +306,7 @@

    Returns AVLTree.BFS

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:943

  • Performs a breadth-first search (BFS) on a binary tree, accumulating nodes themselves.

    @@ -325,7 +325,7 @@

    Returns AVLTree.BFS

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:950

    • BFSCount

      @@ -338,7 +338,7 @@

      Returns number

    +
  • Defined in src/data-structures/binary-tree/tree-multiset.ts:527

    • DFS

  • Performs a depth-first search (DFS) traversal on a binary tree and accumulates properties of each node based on the specified property name.

    @@ -376,7 +376,7 @@

    Returns numberImplementation of ITreeMultiset.DFS

    Inherited from AVLTree.DFS

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:988

  • Performs a depth-first search (DFS) traversal on a binary tree and accumulates the 'val' property of each node.

    @@ -400,7 +400,7 @@

    Returns AVLTree.DFS

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:996

  • Performs a depth-first search (DFS) traversal on a binary tree and accumulates nodes themselves.

    @@ -424,7 +424,7 @@

    Returns AVLTree.DFS

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1004

    • DFSCount

    +
  • Defined in src/data-structures/binary-tree/tree-multiset.ts:579

    • DFSIterative

  • Performs an iterative depth-first search (DFS) traversal on a binary tree and accumulates properties of each node based on the specified property name.

    @@ -484,7 +484,7 @@

    Returns numberImplementation of ITreeMultiset.DFSIterative

    Inherited from AVLTree.DFSIterative

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1055

  • Performs an iterative depth-first search (DFS) traversal on a binary tree and accumulates the 'val' property of each node.

    @@ -508,7 +508,7 @@

    Returns AVLTree.DFSIterative

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1063

  • Performs an iterative depth-first search (DFS) traversal on a binary tree and accumulates nodes themselves.

    @@ -532,7 +532,7 @@

    Returns AVLTree.DFSIterative

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1071

    • DFSIterativeCount

    +
  • Defined in src/data-structures/binary-tree/tree-multiset.ts:566

    • Protected _accumulatedByPropertyName

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1584

    • _addTo

    +
  • Defined in src/data-structures/binary-tree/tree-multiset.ts:194

    • Protected _balanceFactor

    +
  • Defined in src/data-structures/binary-tree/avl-tree.ts:84

    • Protected _balanceLL

    +
  • Defined in src/data-structures/binary-tree/avl-tree.ts:155

    • Protected _balanceLR

    +
  • Defined in src/data-structures/binary-tree/avl-tree.ts:185

    • Protected _balancePath

    +
  • Defined in src/data-structures/binary-tree/avl-tree.ts:112

    • Protected _balanceRL

    +
  • Defined in src/data-structures/binary-tree/avl-tree.ts:268

    • Protected _balanceRR

    +
  • Defined in src/data-structures/binary-tree/avl-tree.ts:233

    • Protected _clearResults

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1526

    • Protected _compare

    +
  • Defined in src/data-structures/binary-tree/bst.ts:529

    • Protected _getResultByPropertyName

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1615

    • Protected _pushByPropertyNameStopOrNot

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1548

    • Protected _setCount

    +
  • Defined in src/data-structures/binary-tree/tree-multiset.ts:697

    • Protected _setLoopType

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1466

    • Protected _setRoot

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1507

    • Protected _setSize

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1518

    • Protected _setVisitedId

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1474

    • Protected _setVisitedLeftSum

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1498

    • Protected _setVisitedNode

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1490

    • Protected _setVisitedVal

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1482

    • Protected _updateHeight

    +
  • Defined in src/data-structures/binary-tree/avl-tree.ts:98

    • add

    +
  • Defined in src/data-structures/binary-tree/tree-multiset.ts:116

    • addMany

    +
  • Defined in src/data-structures/binary-tree/tree-multiset.ts:229

    • allGreaterNodesAdd

    +
  • Defined in src/data-structures/binary-tree/bst.ts:370

    • allGreaterNodesAddCount

    +
  • Defined in src/data-structures/binary-tree/tree-multiset.ts:651

    • clear

    +
  • Defined in src/data-structures/binary-tree/tree-multiset.ts:688

    • createNode

    +
  • Defined in src/data-structures/binary-tree/tree-multiset.ts:75

    • fill

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:345

    • get

    +
  • Defined in src/data-structures/binary-tree/bst.ts:211

    • getDepth

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:412

    • getHeight

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:430

    • getLeftMost

  • The function getLeftMost returns the leftmost node in a binary tree, starting from a specified node or the root if @@ -1352,7 +1352,7 @@

    Returns AVLTree.getLeftMost

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:651

    • getMinHeight

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:479

    • getNodes

    +
  • Defined in src/data-structures/binary-tree/bst.ts:240

    • getNodesByCount

    +
  • Defined in src/data-structures/binary-tree/tree-multiset.ts:486

    • getPathToRoot

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:615

    • getPredecessor

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1284

    • getRightMost

  • The getRightMost function returns the rightmost node in a binary tree, either recursively or iteratively using tail @@ -1534,7 +1534,7 @@

    Returns AVLTree.getRightMost

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:705

    • getSubTreeCount

    +
  • Defined in src/data-structures/binary-tree/tree-multiset.ts:368

    • getSubTreeSize

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:789

    • has

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:582

    • isAVLBalanced

    +
  • Defined in src/data-structures/binary-tree/bst.ts:475

    • isBST

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:779

    • isEmpty

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:237

    • isPerfectlyBalanced

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:529

    • isSubtreeBST

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:745

    • lastKey

    +
  • Defined in src/data-structures/binary-tree/bst.ts:223

    • lesserSum

    +
  • Defined in src/data-structures/binary-tree/bst.ts:293

    • lesserSumCount

    +
  • Defined in src/data-structures/binary-tree/tree-multiset.ts:591

    • levelIterative

  • Performs a level-order traversal on a binary tree starting from the specified node and accumulates properties of each node based on the specified property name.

    @@ -1810,7 +1810,7 @@

    Returns numberImplementation of ITreeMultiset.levelIterative

    Inherited from AVLTree.levelIterative

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1138

  • Performs a level-order traversal on a binary tree starting from the specified node and accumulates the 'val' property of each node.

    @@ -1834,7 +1834,7 @@

    Returns AVLTree.levelIterative

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1146

  • Performs a level-order traversal on a binary tree starting from the specified node and accumulates nodes themselves.

    @@ -1858,7 +1858,7 @@

    Returns AVLTree.levelIterative

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1154

    • listLevels

  • Collects nodes from a binary tree by a specified property and organizes them into levels.

    @@ -1900,7 +1900,7 @@

    Returns numberImplementation of ITreeMultiset.listLevels

    Inherited from AVLTree.listLevels

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1205

  • Collects nodes from a binary tree by a specified property and organizes them into levels.

    @@ -1924,7 +1924,7 @@

    Returns AVLTree.listLevels

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1213

  • Collects nodes from a binary tree by a specified property and organizes them into levels.

    @@ -1948,7 +1948,7 @@

    Returns AVLTree.listLevels

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1221

    • listLevelsCount

    +
  • Defined in src/data-structures/binary-tree/tree-multiset.ts:540

    • morris

  • Performs an in-order, pre-order, or post-order traversal on a binary tree using the Morris traversal algorithm and accumulates properties of each node based on the specified property name.

    @@ -2009,7 +2009,7 @@

    Returns numberImplementation of ITreeMultiset.morris

    Inherited from AVLTree.morris

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1315

  • Performs an in-order, pre-order, or post-order traversal on a binary tree using the Morris traversal algorithm and accumulates the 'val' property of each node.

    @@ -2033,7 +2033,7 @@

    Returns AVLTree.morris

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1323

  • Performs an in-order, pre-order, or post-order traversal on a binary tree using the Morris traversal algorithm and accumulates nodes themselves.

    @@ -2057,7 +2057,7 @@

    Returns AVLTree.morris

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:1331

    • morrisCount

    +
  • Defined in src/data-structures/binary-tree/tree-multiset.ts:552

    • perfectlyBalance

    +
  • Defined in src/data-structures/binary-tree/tree-multiset.ts:258

    • remove

    +
  • Defined in src/data-structures/binary-tree/tree-multiset.ts:305

    • subTreeAdd

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:882

    • subTreeAddCount

    +
  • Defined in src/data-structures/binary-tree/tree-multiset.ts:444

    • subTreeSum

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:826

    • subTreeSumCount

    +
  • Defined in src/data-structures/binary-tree/tree-multiset.ts:405

    • swapLocation

    +
  • Defined in src/data-structures/binary-tree/tree-multiset.ts:86
    • diff --git a/docs/classes/TreeMultisetNode.html b/docs/classes/TreeMultisetNode.html index f231ff28..8890fd0e 100644 --- a/docs/classes/TreeMultisetNode.html +++ b/docs/classes/TreeMultisetNode.html @@ -33,7 +33,7 @@

    Implements

    +
  • Defined in src/data-structures/binary-tree/tree-multiset.ts:13
    • @@ -100,14 +100,14 @@

    Returns

    +
  • Defined in src/data-structures/binary-tree/tree-multiset.ts:27

    • Properties

    Private _count

    _count: number
    +
  • Defined in src/data-structures/binary-tree/tree-multiset.ts:32

    • Accessors

    @@ -117,7 +117,7 @@

    count

    Returns number

     +
  • Defined in src/data-structures/binary-tree/tree-multiset.ts:34
  • set count(v): void
  • @@ -127,7 +127,7 @@

    Parameters

    v: number

    • Returns void

    +
  • Defined in src/data-structures/binary-tree/tree-multiset.ts:38

    • familyPosition

    +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:110

    • height

  • set height(v): void
  • @@ -163,7 +163,7 @@

    Returns voidImplementation of ITreeMultisetNode.height

    Inherited from AVLTreeNode.height

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:102

    • id

  • set id(v): void
  • @@ -185,7 +185,7 @@

    Returns voidImplementation of ITreeMultisetNode.id

    Inherited from AVLTreeNode.id

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:46

    • left

  • set left(v): void
  • @@ -207,7 +207,7 @@

    Returns voidImplementation of ITreeMultisetNode.left

    Inherited from AVLTreeNode.left

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:66

    • parent

  • set parent(v): void
  • @@ -229,7 +229,7 @@

    Returns voidImplementation of ITreeMultisetNode.parent

    Inherited from AVLTreeNode.parent

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:92

    • right

  • set right(v): void
  • @@ -251,7 +251,7 @@

    Returns voidImplementation of ITreeMultisetNode.right

    Inherited from AVLTreeNode.right

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:79

    • val

  • set val(value): void
  • @@ -273,7 +273,7 @@

    Returns voidImplementation of ITreeMultisetNode.val

    Inherited from AVLTreeNode.val

    • +
  • Defined in src/data-structures/binary-tree/abstract-binary-tree.ts:56
    • diff --git a/docs/classes/TreeNode.html b/docs/classes/TreeNode.html index 786abe13..e2150a77 100644 --- a/docs/classes/TreeNode.html +++ b/docs/classes/TreeNode.html @@ -25,7 +25,7 @@

    Hierarchy

    • TreeNode
    +
  • Defined in src/data-structures/tree/tree.ts:1
    • @@ -75,24 +75,24 @@
    Optional Optional children: TreeNode<T>[]

    Returns TreeNode<T>

    +
  • Defined in src/data-structures/tree/tree.ts:2

    • Properties

    Private Optional _children

    _children?: TreeNode<T>[]
    +
  • Defined in src/data-structures/tree/tree.ts:28

    • Private _id

    _id: string
    +
  • Defined in src/data-structures/tree/tree.ts:8

    • Private Optional _value

    _value?: T
    +
  • Defined in src/data-structures/tree/tree.ts:18

    • Accessors

    @@ -102,7 +102,7 @@

    children

    Returns undefined | TreeNode<T>[]

    +
  • Defined in src/data-structures/tree/tree.ts:30
  • set children(value): void
  • @@ -112,7 +112,7 @@

    Parameters

    value: undefined | TreeNode<T>[]

    • Returns void

    +
  • Defined in src/data-structures/tree/tree.ts:34

    • id

  • set id(value): void
  • @@ -130,7 +130,7 @@

    Parameters

    value: string

    • Returns void

    +
  • Defined in src/data-structures/tree/tree.ts:14

    • value

  • set value(value): void
  • @@ -148,7 +148,7 @@

    Parameters

    value: undefined | T

    • Returns void

    +
  • Defined in src/data-structures/tree/tree.ts:24

    • Methods

    @@ -163,7 +163,7 @@

    Parameters

    children: TreeNode<T> | TreeNode<T>[]

    Returns void

    +
  • Defined in src/data-structures/tree/tree.ts:38

    • getHeight

    +
  • Defined in src/data-structures/tree/tree.ts:49
    • diff --git a/docs/classes/TreeSet.html b/docs/classes/TreeSet.html index 15b1c16b..61fead61 100644 --- a/docs/classes/TreeSet.html +++ b/docs/classes/TreeSet.html @@ -20,7 +20,7 @@

    Hierarchy

    • TreeSet
    +
  • Defined in src/data-structures/hash/tree-set.ts:1
    • diff --git a/docs/classes/Trie.html b/docs/classes/Trie.html index b0c9391e..733b2298 100644 --- a/docs/classes/Trie.html +++ b/docs/classes/Trie.html @@ -20,7 +20,7 @@

    Hierarchy

    • Trie
    +
  • Defined in src/data-structures/trie/trie.ts:46
    • @@ -63,14 +63,14 @@

    Parameters

    Optional words: string[]

    Returns Trie

    +
  • Defined in src/data-structures/trie/trie.ts:47

    • Properties

    Protected _root

    _root: TrieNode
    +
  • Defined in src/data-structures/trie/trie.ts:56

    • Accessors

    @@ -80,7 +80,7 @@

    root

    Returns TrieNode

    +
  • Defined in src/data-structures/trie/trie.ts:58
  • set root(v): void
  • @@ -90,7 +90,7 @@

    Parameters

    v: TrieNode

    • Returns void

    +
  • Defined in src/data-structures/trie/trie.ts:62

    • Methods

    @@ -105,7 +105,7 @@

    Parameters

    word: string

    Returns boolean

    +
  • Defined in src/data-structures/trie/trie.ts:66

    • getAll

    +
  • Defined in src/data-structures/trie/trie.ts:196

    • getLongestCommonPrefix

    +
  • Defined in src/data-structures/trie/trie.ts:178

    • has

      @@ -153,7 +153,7 @@

      Parameters

      input: string

    Returns boolean

    +
  • Defined in src/data-structures/trie/trie.ts:80

    • isAbsPrefix

    +
  • Defined in src/data-structures/trie/trie.ts:128

    • isCommonPrefix

    +
  • Defined in src/data-structures/trie/trie.ts:159

    • isPrefix

    +
  • Defined in src/data-structures/trie/trie.ts:143

    • remove

      @@ -227,7 +227,7 @@

      Parameters

      word: string

    Returns boolean

    +
  • Defined in src/data-structures/trie/trie.ts:90
    • diff --git a/docs/classes/TrieNode.html b/docs/classes/TrieNode.html index 7182ae72..8ee677af 100644 --- a/docs/classes/TrieNode.html +++ b/docs/classes/TrieNode.html @@ -30,7 +30,7 @@

    Hierarchy

    • TrieNode
    +
  • Defined in src/data-structures/trie/trie.ts:8
    • @@ -66,24 +66,24 @@

    Parameters

    v: string

    Returns TrieNode

    +
  • Defined in src/data-structures/trie/trie.ts:9

    • Properties

    Protected _children

    _children: Map<string, TrieNode>
    +
  • Defined in src/data-structures/trie/trie.ts:25

    • Protected _isEnd

    _isEnd: boolean
    +
  • Defined in src/data-structures/trie/trie.ts:35

    • Private _val

    _val: string
    +
  • Defined in src/data-structures/trie/trie.ts:15

    • Accessors

    @@ -93,7 +93,7 @@

    children

    Returns Map<string, TrieNode>

    +
  • Defined in src/data-structures/trie/trie.ts:27
  • set children(v): void
  • @@ -103,7 +103,7 @@

    Parameters

    v: Map<string, TrieNode>

    • Returns void

    +
  • Defined in src/data-structures/trie/trie.ts:31

    • isEnd

  • set isEnd(v): void
  • @@ -121,7 +121,7 @@

    Parameters

    v: boolean

    • Returns void

    +
  • Defined in src/data-structures/trie/trie.ts:41

    • val

  • set val(v): void
  • @@ -139,7 +139,7 @@

    Parameters

    v: string

    • Returns void

    +
  • Defined in src/data-structures/trie/trie.ts:21
    • diff --git a/docs/classes/TwoThreeTree.html b/docs/classes/TwoThreeTree.html index b98071df..c03c40d7 100644 --- a/docs/classes/TwoThreeTree.html +++ b/docs/classes/TwoThreeTree.html @@ -20,7 +20,7 @@

    Hierarchy

    • TwoThreeTree
    +
  • Defined in src/data-structures/binary-tree/two-three-tree.ts:1
    • diff --git a/docs/classes/UndirectedEdge.html b/docs/classes/UndirectedEdge.html index 6b9a1c97..9d48b190 100644 --- a/docs/classes/UndirectedEdge.html +++ b/docs/classes/UndirectedEdge.html @@ -27,7 +27,7 @@

    Hierarchy

    • UndirectedEdge
    +
  • Defined in src/data-structures/graph/undirected-graph.ts:26
    • @@ -97,7 +97,7 @@

    Returns

    +
  • Defined in src/data-structures/graph/undirected-graph.ts:37

    • Properties

    @@ -105,12 +105,12 @@

    Protected_hashCode: string

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:83

    • Private _vertices

    _vertices: [VertexId, VertexId]
    +
  • Defined in src/data-structures/graph/undirected-graph.ts:42

    • Accessors

    @@ -121,7 +121,7 @@

    hashCodeReturns string

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:85

    • val

  • set val(value): void
  • @@ -141,7 +141,7 @@
    value: Returns void
    • +
  • Defined in src/data-structures/graph/abstract-graph.ts:69

    • vertices

  • set vertices(v): void
  • @@ -159,7 +159,7 @@

    Parameters

    v: [VertexId, VertexId]

    • Returns void

    +
  • Defined in src/data-structures/graph/undirected-graph.ts:48

    • weight

  • set weight(v): void
  • @@ -179,7 +179,7 @@
    v:

    Returns void

    • +
  • Defined in src/data-structures/graph/abstract-graph.ts:79

    • Methods

    @@ -202,7 +202,7 @@

    Returns void

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:99
    • diff --git a/docs/classes/UndirectedGraph.html b/docs/classes/UndirectedGraph.html index f0417cf8..5439e2c0 100644 --- a/docs/classes/UndirectedGraph.html +++ b/docs/classes/UndirectedGraph.html @@ -33,7 +33,7 @@

    Implements

    +
  • Defined in src/data-structures/graph/undirected-graph.ts:53
    • @@ -108,14 +108,14 @@

    Returns

    +
  • Defined in src/data-structures/graph/undirected-graph.ts:63

    • Properties

    Protected _edges

    _edges: Map<V, E[]>
    +
  • Defined in src/data-structures/graph/undirected-graph.ts:68

    • Accessors

    @@ -125,7 +125,7 @@

    edges

    Returns Map<V, E[]>

    +
  • Defined in src/data-structures/graph/undirected-graph.ts:70

    • vertices

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:111

    • Methods

    @@ -157,7 +157,7 @@

    Returns boolean

    +
  • Defined in src/data-structures/graph/undirected-graph.ts:251

    • Protected _addVertexOnly

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:1019

    • Protected _getVertex

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:1028

    • Protected _getVertexId

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:1033

    • Protected _setEdges

    +
  • Defined in src/data-structures/graph/undirected-graph.ts:271

    • Protected _setVertices

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:1037

    • addEdge

  • @@ -265,7 +265,7 @@

    Returns booleanImplementation of IUNDirectedGraph.addEdge

    Inherited from AbstractGraph.addEdge

    • +
  • Defined in src/data-structures/graph/abstract-graph.ts:222

    • addVertex

  • @@ -294,7 +294,7 @@

    Returns booleanImplementation of IUNDirectedGraph.addVertex

    Inherited from AbstractGraph.addVertex

    • +
  • Defined in src/data-structures/graph/abstract-graph.ts:170

    • bellmanFord

      @@ -355,7 +355,7 @@
      preMap
    +
  • Defined in src/data-structures/graph/abstract-graph.ts:725

    • createEdge

    +
  • Defined in src/data-structures/graph/undirected-graph.ts:97

    • createVertex

    +
  • Defined in src/data-structures/graph/undirected-graph.ts:83

    • degreeOf

    +
  • Defined in src/data-structures/graph/undirected-graph.ts:167

    • dijkstra

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:596

    • dijkstraWithoutHeap

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:456

    • edgeSet

    +
  • Defined in src/data-structures/graph/undirected-graph.ts:195

    • edgesOf

    +
  • Defined in src/data-structures/graph/undirected-graph.ts:182

    • floyd

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:851

    • getAllPathsBetween

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:268

    • getEdge

    +
  • Defined in src/data-structures/graph/undirected-graph.ts:109

    • getEndsOfEdge

    +
  • Defined in src/data-structures/graph/undirected-graph.ts:233

    • getMinCostBetween

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:326

    • getMinPathBetween

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:384

    • getNeighbors

    +
  • Defined in src/data-structures/graph/undirected-graph.ts:211

    • getPathSumWeight

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:304

    • getVertex

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:154

    • hasEdge

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:215

    • hasVertex

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:164

    • removeAllVertices

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:199

    • removeEdge

    +
  • Defined in src/data-structures/graph/undirected-graph.ts:156

    • removeEdgeBetween

    +
  • Defined in src/data-structures/graph/undirected-graph.ts:131

    • removeVertex

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:187

    • setEdgeWeight

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:251

    • tarjan

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:915
    • diff --git a/docs/classes/UndirectedVertex.html b/docs/classes/UndirectedVertex.html index 3db87589..c84eae02 100644 --- a/docs/classes/UndirectedVertex.html +++ b/docs/classes/UndirectedVertex.html @@ -27,7 +27,7 @@

    Hierarchy

    • UndirectedVertex
    +
  • Defined in src/data-structures/graph/undirected-graph.ts:13
    • @@ -75,7 +75,7 @@

    Returns

    +
  • Defined in src/data-structures/graph/undirected-graph.ts:21

    • Accessors

    @@ -86,7 +86,7 @@

    idReturns VertexId

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:28
  • set id(v): void
  • @@ -97,7 +97,7 @@
    v: Returns void
    • +
  • Defined in src/data-structures/graph/abstract-graph.ts:32

    • val

  • set val(value): void
  • @@ -117,7 +117,7 @@
    value: Returns void
    • +
  • Defined in src/data-structures/graph/abstract-graph.ts:42
    • diff --git a/docs/classes/Vector2D.html b/docs/classes/Vector2D.html index 73cccc66..adbbb9e7 100644 --- a/docs/classes/Vector2D.html +++ b/docs/classes/Vector2D.html @@ -30,7 +30,7 @@

    Hierarchy

    • Vector2D
    +
  • Defined in src/data-structures/matrix/vector2d.ts:8
    • @@ -93,24 +93,24 @@
    y:
    w: number = 1

    Returns Vector2D

    +
  • Defined in src/data-structures/matrix/vector2d.ts:9

    • Properties

    w

    w: number = 1
    +
  • Defined in src/data-structures/matrix/vector2d.ts:12

    • x

    x: number = 0
    +
  • Defined in src/data-structures/matrix/vector2d.ts:10

    • y

    y: number = 0
    +
  • Defined in src/data-structures/matrix/vector2d.ts:11

    • Accessors

    @@ -124,7 +124,7 @@

    Returns boolean

    +
  • Defined in src/data-structures/matrix/vector2d.ts:19

    • length

      @@ -136,7 +136,7 @@

      Returns number

    +
  • Defined in src/data-structures/matrix/vector2d.ts:27

    • lengthSq

    +
  • Defined in src/data-structures/matrix/vector2d.ts:35

    • rounded

    +
  • Defined in src/data-structures/matrix/vector2d.ts:44

    • Methods

    @@ -174,7 +174,7 @@

    zeroReturns void

    +
  • Defined in src/data-structures/matrix/vector2d.ts:310

    • Static abs

    +
  • Defined in src/data-structures/matrix/vector2d.ts:203

    • Static add

    +
  • Defined in src/data-structures/matrix/vector2d.ts:58

    • Static angle

    +
  • Defined in src/data-structures/matrix/vector2d.ts:288

    • Static distance

    +
  • Defined in src/data-structures/matrix/vector2d.ts:244

    • Static distanceSq

    +
  • Defined in src/data-structures/matrix/vector2d.ts:258

    • Static divide

    +
  • Defined in src/data-structures/matrix/vector2d.ts:110

    • Static dot

    +
  • Defined in src/data-structures/matrix/vector2d.ts:214

    • Static equals

    +
  • Defined in src/data-structures/matrix/vector2d.ts:121

    • Static equalsRounded

    +
  • Defined in src/data-structures/matrix/vector2d.ts:135

    • Static multiply

    +
  • Defined in src/data-structures/matrix/vector2d.ts:98

    • Static normalize

    +
  • Defined in src/data-structures/matrix/vector2d.ts:150

    • Static perp

    +
  • Defined in src/data-structures/matrix/vector2d.ts:181

    • Static random

    +
  • Defined in src/data-structures/matrix/vector2d.ts:301

    • Static reverse

    +
  • Defined in src/data-structures/matrix/vector2d.ts:191

    • Static sign

    +
  • Defined in src/data-structures/matrix/vector2d.ts:273

    • Static subtract

    +
  • Defined in src/data-structures/matrix/vector2d.ts:73

    • Static subtractValue

    +
  • Defined in src/data-structures/matrix/vector2d.ts:86

    • Static truncate

    +
  • Defined in src/data-structures/matrix/vector2d.ts:168
    • diff --git a/docs/enums/CP.html b/docs/enums/CP.html index 15183896..ff8ffa74 100644 --- a/docs/enums/CP.html +++ b/docs/enums/CP.html @@ -16,7 +16,7 @@
  • CP

    • Enumeration CP

    +
  • Defined in src/types/data-structures/bst.ts:13
    • @@ -34,17 +34,17 @@

    Enumeration Members

    eq

    eq: "eq"
    +
  • Defined in src/types/data-structures/bst.ts:13

    • gt

    gt: "gt"
    +
  • Defined in src/types/data-structures/bst.ts:13

    • lt

    lt: "lt"
    +
  • Defined in src/types/data-structures/bst.ts:13
    • diff --git a/docs/enums/FamilyPosition.html b/docs/enums/FamilyPosition.html index dd782e45..40d41bb8 100644 --- a/docs/enums/FamilyPosition.html +++ b/docs/enums/FamilyPosition.html @@ -16,7 +16,7 @@
  • FamilyPosition

    • Enumeration FamilyPosition

    +
  • Defined in src/types/data-structures/abstract-binary-tree.ts:16
    • @@ -38,37 +38,37 @@

    Enumeration Members

    ISOLATED

    ISOLATED: "ISOLATED"
    +
  • Defined in src/types/data-structures/abstract-binary-tree.ts:22

    • LEFT

    LEFT: "LEFT"
    +
  • Defined in src/types/data-structures/abstract-binary-tree.ts:18

    • MAL_NODE

    MAL_NODE: "MAL_NODE"
    +
  • Defined in src/types/data-structures/abstract-binary-tree.ts:23

    • RIGHT

    RIGHT: "RIGHT"
    +
  • Defined in src/types/data-structures/abstract-binary-tree.ts:19

    • ROOT

    ROOT: "ROOT"
    +
  • Defined in src/types/data-structures/abstract-binary-tree.ts:17

    • ROOT_LEFT

    ROOT_LEFT: "ROOT_LEFT"
    +
  • Defined in src/types/data-structures/abstract-binary-tree.ts:20

    • ROOT_RIGHT

    ROOT_RIGHT: "ROOT_RIGHT"
    +
  • Defined in src/types/data-structures/abstract-binary-tree.ts:21
    • diff --git a/docs/enums/LoopType.html b/docs/enums/LoopType.html index 2547d0c1..2e0c97cc 100644 --- a/docs/enums/LoopType.html +++ b/docs/enums/LoopType.html @@ -24,7 +24,7 @@

    Enumeration LoopType

    +
  • Defined in src/types/data-structures/abstract-binary-tree.ts:10
    • @@ -41,12 +41,12 @@

    Enumeration Members

    ITERATIVE

    ITERATIVE: "ITERATIVE"
    +
  • Defined in src/types/data-structures/abstract-binary-tree.ts:11

    • RECURSIVE

    RECURSIVE: "RECURSIVE"
    +
  • Defined in src/types/data-structures/abstract-binary-tree.ts:12
    • diff --git a/docs/enums/RBColor.html b/docs/enums/RBColor.html index 1d479fd9..6b25b500 100644 --- a/docs/enums/RBColor.html +++ b/docs/enums/RBColor.html @@ -16,7 +16,7 @@
  • RBColor

    • Enumeration RBColor

    +
  • Defined in src/types/data-structures/rb-tree.ts:4
    • @@ -33,12 +33,12 @@

    Enumeration Members

    BLACK

    BLACK: "BLACK"
    +
  • Defined in src/types/data-structures/rb-tree.ts:4

    • RED

    RED: "RED"
    +
  • Defined in src/types/data-structures/rb-tree.ts:4
    • diff --git a/docs/enums/TopologicalProperty.html b/docs/enums/TopologicalProperty.html index 7c56f9cc..f074448e 100644 --- a/docs/enums/TopologicalProperty.html +++ b/docs/enums/TopologicalProperty.html @@ -16,7 +16,7 @@
  • TopologicalProperty

    • Enumeration TopologicalProperty

    +
  • Defined in src/types/data-structures/directed-graph.ts:4
    • @@ -34,17 +34,17 @@

    Enumeration Members

    ID

    ID: "ID"
    +
  • Defined in src/types/data-structures/directed-graph.ts:7

    • NODE

    NODE: "NODE"
    +
  • Defined in src/types/data-structures/directed-graph.ts:6

    • VAL

    VAL: "VAL"
    +
  • Defined in src/types/data-structures/directed-graph.ts:5
    • diff --git a/docs/functions/arrayRemove.html b/docs/functions/arrayRemove.html index a60589ac..c76640c3 100644 --- a/docs/functions/arrayRemove.html +++ b/docs/functions/arrayRemove.html @@ -48,7 +48,7 @@
    array: Returns boolean

    Returns T[]

    +
  • Defined in src/utils/utils.ts:18
    • diff --git a/docs/functions/isThunk.html b/docs/functions/isThunk.html index 5d18f299..627f9195 100644 --- a/docs/functions/isThunk.html +++ b/docs/functions/isThunk.html @@ -26,7 +26,7 @@

    Parameters

    fnOrValue: any

    Returns boolean

    +
  • Defined in src/utils/utils.ts:37
    • diff --git a/docs/functions/toThunk.html b/docs/functions/toThunk.html index 05fbfb04..3aad742f 100644 --- a/docs/functions/toThunk.html +++ b/docs/functions/toThunk.html @@ -26,7 +26,7 @@

    Parameters

    fn: ToThunkFn

    Returns Thunk

    +
  • Defined in src/utils/utils.ts:41
    • diff --git a/docs/functions/trampoline.html b/docs/functions/trampoline.html index ce40fc38..070f64ea 100644 --- a/docs/functions/trampoline.html +++ b/docs/functions/trampoline.html @@ -26,7 +26,7 @@

    Parameters

    fn: TrlFn

    Returns ((...args) => any) & {
        cont: ((...args) => Thunk);
    }

    +
  • Defined in src/utils/utils.ts:47
    • diff --git a/docs/functions/trampolineAsync.html b/docs/functions/trampolineAsync.html index dc5578a6..72713972 100644 --- a/docs/functions/trampolineAsync.html +++ b/docs/functions/trampolineAsync.html @@ -26,7 +26,7 @@

    Parameters

    fn: TrlAsyncFn

    Returns ((...args) => Promise<any>) & {
        cont: ((...args) => Thunk);
    }

    +
  • Defined in src/utils/utils.ts:64
    • diff --git a/docs/functions/uuidV4.html b/docs/functions/uuidV4.html index 49925e90..064ae599 100644 --- a/docs/functions/uuidV4.html +++ b/docs/functions/uuidV4.html @@ -21,7 +21,7 @@

    Function uuidV4

  • Returns string

    • +
  • Defined in src/utils/utils.ts:10
    • diff --git a/docs/index.html b/docs/index.html index b61f98bf..58ad5681 100644 --- a/docs/index.html +++ b/docs/index.html @@ -12,7 +12,7 @@

    data-structure-typed

    -

    What

    License +

    License Language GitHub release (latest by date) Branches @@ -22,7 +22,7 @@

    data-structure-typed

    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.

    -

    How

    install

    npm

    npm install data-structure-typed --save
+
    install
    npm
    npm install data-structure-typed --save
 
    
 
    yarn
    yarn add data-structure-typed
 
    
@@ -228,11 +228,7 @@ 
    data-structure-typed
    -

    Statements -Branches -Functions -Lines

    -

    Why

    Code design

    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.

    +

    Code design

    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.

    Complexities

    performance of Big O

    @@ -512,14 +508,10 @@

    What -
  • -
    • -
  • How
    • -
  • Data Structures
    • -
  • Why
    • -
  • -
    @@ -95,7 +95,7 @@

    loopTypeReturns LoopType

    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:45

    • root

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:55

    • size

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:57

    • visitedId

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:47

    • visitedLeftSum

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:53

    • visitedNode

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:51

    • visitedVal

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:49

    • Methods

    @@ -160,7 +160,7 @@

    BFSReturns number[]

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:113
  • @@ -171,7 +171,7 @@
    nodeOrPropertyName: Returns number[]
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:115
  • @@ -182,7 +182,7 @@
    nodeOrPropertyName: Returns N["val"][]
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:117
  • @@ -193,7 +193,7 @@
    nodeOrPropertyName: Returns N[]
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:119
  • @@ -204,7 +204,7 @@
    nodeOrPropertyName: Returns number[]
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:121
  • @@ -215,7 +215,7 @@
    Optional Returns AbstractBinaryTreeNodeProperties<N>
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:123

    • DFS

  • @@ -237,7 +237,7 @@
    Optional Returns number[]
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:127
  • @@ -250,7 +250,7 @@
    Optional Returns N[]
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:129
  • @@ -263,7 +263,7 @@
    Optional Returns N[]
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:131
  • @@ -276,7 +276,7 @@
    Optional Returns number[]
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:133
  • @@ -289,7 +289,7 @@
    Optional Returns AbstractBinaryTreeNodeProperties<N>
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:135

    • DFSIterative

  • @@ -311,7 +311,7 @@
    Optional Returns number[]
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:139
  • @@ -324,7 +324,7 @@
    Optional Returns N[]
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:141
  • @@ -337,7 +337,7 @@
    Optional Returns N[]
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:143
  • @@ -350,7 +350,7 @@
    Optional Returns number[]
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:145
  • @@ -363,7 +363,7 @@
    Optional Returns AbstractBinaryTreeNodeProperties<N>
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:147

    • add

    +
  • Defined in src/interfaces/avl-tree.ts:8

    • addMany

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:67

    • allGreaterNodesAdd

    +
  • Defined in src/interfaces/bst.ts:24

    • clear

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:61

    • createNode

    +
  • Defined in src/interfaces/bst.ts:8

    • fill

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:69

    • get

    +
  • Defined in src/interfaces/bst.ts:12

    • getDepth

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:73

    • getHeight

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:75

    • getLeftMost

  • @@ -520,7 +520,7 @@
    node: Returns N
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:91
  • @@ -531,7 +531,7 @@
    Optional Returns null | N
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:93

    • getMinHeight

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:77

    • getNodes

    +
  • Defined in src/interfaces/bst.ts:18

    • getPathToRoot

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:87

    • getPredecessor

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:176

    • getRightMost

  • @@ -611,7 +611,7 @@
    node: Returns N
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:97
  • @@ -622,7 +622,7 @@
    Optional Returns null | N
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:99

    • getSubTreeSize

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:105

    • has

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:83

    • isAVLBalanced

    +
  • Defined in src/interfaces/bst.ts:28

    • isBST

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:103

    • isEmpty

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:63

    • isPerfectlyBalanced

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:79

    • isSubtreeBST

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:101

    • lastKey

    +
  • Defined in src/interfaces/bst.ts:14

    • lesserSum

    +
  • Defined in src/interfaces/bst.ts:22

    • levelIterative

  • @@ -759,7 +759,7 @@
    Optional Returns number[]
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:154
  • @@ -772,7 +772,7 @@
    Optional Returns N["val"][]
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:156
  • @@ -785,7 +785,7 @@
    Optional Returns N[]
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:158
  • @@ -798,7 +798,7 @@
    Optional Returns number[]
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:160
  • @@ -811,7 +811,7 @@
    Optional Returns AbstractBinaryTreeNodeProperties<N>
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:162

    • listLevels

  • @@ -838,7 +838,7 @@
    Optional Returns number[][]
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:166
  • @@ -851,7 +851,7 @@
    Optional Returns N["val"][][]
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:168
  • @@ -864,7 +864,7 @@
    Optional Returns N[][]
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:170
  • @@ -877,7 +877,7 @@
    Optional Returns number[][]
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:172
  • @@ -890,7 +890,7 @@
    Optional Returns AbstractBinaryTreeNodeProperty<N>[][]
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:174

    • morris

  • @@ -912,7 +912,7 @@
    Optional Returns number[]
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:180
  • @@ -925,7 +925,7 @@
    Optional Returns N[]
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:182
  • @@ -938,7 +938,7 @@
    Optional Returns N[]
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:184
  • @@ -951,7 +951,7 @@
    Optional Returns number[]
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:186
  • @@ -964,7 +964,7 @@
    Optional Returns AbstractBinaryTreeNodeProperties<N>
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:188

    • perfectlyBalance

    +
  • Defined in src/interfaces/bst.ts:26

    • remove

    +
  • Defined in src/interfaces/avl-tree.ts:10

    • subTreeAdd

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:111

    • subTreeSum

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:109

    • swapLocation

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:59
    • diff --git a/docs/interfaces/IAbstractBinaryTree.html b/docs/interfaces/IAbstractBinaryTree.html index 51803917..8fe6d04c 100644 --- a/docs/interfaces/IAbstractBinaryTree.html +++ b/docs/interfaces/IAbstractBinaryTree.html @@ -29,7 +29,7 @@

    Implemented by

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:42
    • @@ -87,7 +87,7 @@

    loopType

    Returns LoopType

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:45

    • root

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:55

    • size

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:57

    • visitedId

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:47

    • visitedLeftSum

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:53

    • visitedNode

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:51

    • visitedVal

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:49

    • Methods

    @@ -145,7 +145,7 @@

    BFS

    Returns number[]

     +
  • Defined in src/interfaces/abstract-binary-tree.ts:113
  • @@ -155,7 +155,7 @@

    Parameters

    nodeOrPropertyName: "id"

    • Returns number[]

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:115
  • @@ -165,7 +165,7 @@

    Parameters

    nodeOrPropertyName: "val"

    • Returns N["val"][]

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:117
  • @@ -175,7 +175,7 @@

    Parameters

    nodeOrPropertyName: "node"

    • Returns N[]

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:119
  • @@ -185,7 +185,7 @@

    Parameters

    nodeOrPropertyName: "count"

    • Returns number[]

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:121
  • @@ -195,7 +195,7 @@

    Parameters

    Optional nodeOrPropertyName: NodeOrPropertyName

    • Returns AbstractBinaryTreeNodeProperties<N>

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:123

    • DFS

  • @@ -215,7 +215,7 @@
    Optional Optional nodeOrPropertyName: "id"

    • Returns number[]

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:127
  • @@ -227,7 +227,7 @@
    Optional Optional nodeOrPropertyName: "val"

    • Returns N[]

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:129
  • @@ -239,7 +239,7 @@
    Optional Optional nodeOrPropertyName: "node"

    • Returns N[]

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:131
  • @@ -251,7 +251,7 @@
    Optional Optional nodeOrPropertyName: "count"

    • Returns number[]

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:133
  • @@ -263,7 +263,7 @@
    Optional Optional nodeOrPropertyName: NodeOrPropertyName

    • Returns AbstractBinaryTreeNodeProperties<N>

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:135

    • DFSIterative

  • @@ -283,7 +283,7 @@
    Optional Optional nodeOrPropertyName: "id"

    • Returns number[]

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:139
  • @@ -295,7 +295,7 @@
    Optional Optional nodeOrPropertyName: "val"

    • Returns N[]

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:141
  • @@ -307,7 +307,7 @@
    Optional Optional nodeOrPropertyName: "node"

    • Returns N[]

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:143
  • @@ -319,7 +319,7 @@
    Optional Optional nodeOrPropertyName: "count"

    • Returns number[]

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:145
  • @@ -331,7 +331,7 @@
    Optional Optional nodeOrPropertyName: NodeOrPropertyName

    • Returns AbstractBinaryTreeNodeProperties<N>

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:147

    • add

      @@ -346,7 +346,7 @@
      id: Optional val: N["val"]

    Returns undefined | null | N

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:65

    • addMany

      @@ -361,7 +361,7 @@
      idsOrNodes: Optional data: N["val"][]

    Returns (undefined | null | N)[]

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:67

    • clear

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:61

    • createNode

      @@ -386,7 +386,7 @@
      Optional Optional count: number

    Returns null | N

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:43

    • fill

      @@ -401,7 +401,7 @@
      idsOrNodes: Optional data: N["val"][] | N[]

    Returns boolean

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:69

    • get

    Returns null | N

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:85

    • getDepth

      @@ -429,7 +429,7 @@

      Parameters

      node: N

    Returns number

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:73

    • getHeight

      @@ -442,7 +442,7 @@

      Parameters

      Optional beginRoot: null | N

    Returns number

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:75

    • getLeftMost

  • @@ -460,7 +460,7 @@

    Parameters

    node: N

    • Returns N

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:91
  • @@ -470,7 +470,7 @@

    Parameters

    Optional node: null | N

    • Returns null | N

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:93

    • getMinHeight

      @@ -483,7 +483,7 @@

      Parameters

      Optional beginRoot: null | N

    Returns number

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:77

    • getNodes

      @@ -500,7 +500,7 @@
      Optional Optional onlyOne: boolean

    Returns N[]

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:81

    • getPathToRoot

      @@ -513,7 +513,7 @@

      Parameters

      node: N

    Returns N[]

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:87

    • getPredecessor

      @@ -526,7 +526,7 @@

      Parameters

      node: N

    Returns N

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:176

    • getRightMost

  • @@ -544,7 +544,7 @@

    Parameters

    node: N

    • Returns N

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:97
  • @@ -554,7 +554,7 @@

    Parameters

    Optional node: null | N

    • Returns null | N

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:99

    • getSubTreeSize

      @@ -567,7 +567,7 @@

      Parameters

      subTreeRoot: undefined | null | N

    Returns number

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:105

    • has

    Returns boolean

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:83

    • isBST

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:103

    • isEmpty

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:63

    • isPerfectlyBalanced

      @@ -611,7 +611,7 @@

      Parameters

      Optional beginRoot: null | N

    Returns boolean

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:79

    • isSubtreeBST

      @@ -624,7 +624,7 @@

      Parameters

      node: null | N

    Returns boolean

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:101

    • levelIterative

      @@ -637,7 +637,7 @@

      Parameters

      node: null | N

    Returns number[]

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:152
  • @@ -649,7 +649,7 @@
    node: Optional nodeOrPropertyName: "id"

    • Returns number[]

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:154
  • @@ -661,7 +661,7 @@
    node: Optional nodeOrPropertyName: "val"

    • Returns N["val"][]

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:156
  • @@ -673,7 +673,7 @@
    node: Optional nodeOrPropertyName: "node"

    • Returns N[]

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:158
  • @@ -685,7 +685,7 @@
    node: Optional nodeOrPropertyName: "count"

    • Returns number[]

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:160
  • @@ -697,7 +697,7 @@
    node: Optional nodeOrPropertyName: NodeOrPropertyName

    • Returns AbstractBinaryTreeNodeProperties<N>

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:162

    • listLevels

      @@ -710,7 +710,7 @@

      Parameters

      node: null | N

    Returns number[][]

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:164
  • @@ -722,7 +722,7 @@
    node: Optional nodeOrPropertyName: "id"

    • Returns number[][]

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:166
  • @@ -734,7 +734,7 @@
    node: Optional nodeOrPropertyName: "val"

    • Returns N["val"][][]

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:168
  • @@ -746,7 +746,7 @@
    node: Optional nodeOrPropertyName: "node"

    • Returns N[][]

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:170
  • @@ -758,7 +758,7 @@
    node: Optional nodeOrPropertyName: "count"

    • Returns number[][]

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:172
  • @@ -770,7 +770,7 @@
    node: Optional nodeOrPropertyName: NodeOrPropertyName

    • Returns AbstractBinaryTreeNodeProperty<N>[][]

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:174

    • morris

  • @@ -790,7 +790,7 @@
    Optional Optional nodeOrPropertyName: "id"

    • Returns number[]

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:180
  • @@ -802,7 +802,7 @@
    Optional Optional nodeOrPropertyName: "val"

    • Returns N[]

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:182
  • @@ -814,7 +814,7 @@
    Optional Optional nodeOrPropertyName: "node"

    • Returns N[]

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:184
  • @@ -826,7 +826,7 @@
    Optional Optional nodeOrPropertyName: "count"

    • Returns number[]

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:186
  • @@ -838,7 +838,7 @@
    Optional Optional nodeOrPropertyName: NodeOrPropertyName

    • Returns AbstractBinaryTreeNodeProperties<N>

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:188

    • remove

      @@ -853,7 +853,7 @@
      id: Optional ignoreCount: boolean

    Returns BinaryTreeDeletedResult<N>[]

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:71

    • subTreeAdd

    Returns boolean

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:111

    • subTreeSum

    Returns number

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:109

    • swapLocation

      @@ -900,7 +900,7 @@
      srcNode: destNode: N

    Returns N

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:59
    • diff --git a/docs/interfaces/IAbstractBinaryTreeNode.html b/docs/interfaces/IAbstractBinaryTreeNode.html index 9c9a3530..8f365904 100644 --- a/docs/interfaces/IAbstractBinaryTreeNode.html +++ b/docs/interfaces/IAbstractBinaryTreeNode.html @@ -31,7 +31,7 @@

    Implemented by

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:14
    • @@ -56,7 +56,7 @@

    familyPosition

    Returns FamilyPosition

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:35

    • height

  • set height(v): void
  • @@ -74,7 +74,7 @@

    Parameters

    v: number

    • Returns void

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:39

    • id

  • set id(v): void
  • @@ -92,7 +92,7 @@

    Parameters

    v: number

    • Returns void

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:17

    • left

  • set left(v): void
  • @@ -110,7 +110,7 @@

    Parameters

    v: undefined | null | NEIGHBOR

    • Returns void

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:25

    • parent

  • set parent(v): void
  • @@ -128,7 +128,7 @@

    Parameters

    v: undefined | null | NEIGHBOR

    • Returns void

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:33

    • right

  • set right(v): void
  • @@ -146,7 +146,7 @@

    Parameters

    v: undefined | null | NEIGHBOR

    • Returns void

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:29

    • val

  • set val(v): void
  • @@ -164,7 +164,7 @@

    Parameters

    v: undefined | T

    • Returns void

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:21
    • diff --git a/docs/interfaces/IAbstractGraph.html b/docs/interfaces/IAbstractGraph.html index d361883a..7c607a0e 100644 --- a/docs/interfaces/IAbstractGraph.html +++ b/docs/interfaces/IAbstractGraph.html @@ -34,7 +34,7 @@

    Implemented by

    +
  • Defined in src/interfaces/abstract-graph.ts:3
    • @@ -77,7 +77,7 @@
    weight: val: E

    Returns boolean

    +
  • Defined in src/interfaces/abstract-graph.ts:22

    • addVertex

    Returns boolean

     +
  • Defined in src/interfaces/abstract-graph.ts:6

    • degreeOf

      @@ -105,7 +105,7 @@

      Parameters

      vertexOrId: V | VertexId

    Returns number

    +
  • Defined in src/interfaces/abstract-graph.ts:12

    • edgeSet

    +
  • Defined in src/interfaces/abstract-graph.ts:20

    • edgesOf

      @@ -126,7 +126,7 @@

      Parameters

      vertexOrId: V | VertexId

    Returns E[]

    +
  • Defined in src/interfaces/abstract-graph.ts:14

    • getEdge

      @@ -141,7 +141,7 @@
      srcOrId: destOrId: V | VertexId

    Returns null | E

    +
  • Defined in src/interfaces/abstract-graph.ts:18

    • getMinPathBetween

      @@ -158,7 +158,7 @@
      v2: Optional isWeight: boolean

    Returns null | V[]

    +
  • Defined in src/interfaces/abstract-graph.ts:28

    • getNeighbors

      @@ -171,7 +171,7 @@

      Parameters

      vertexOrId: V | VertexId

    Returns V[]

    +
  • Defined in src/interfaces/abstract-graph.ts:30

    • hasEdge

      @@ -186,7 +186,7 @@
      src: dest: V | VertexId

    Returns boolean

    +
  • Defined in src/interfaces/abstract-graph.ts:16

    • hasVertex

      @@ -199,7 +199,7 @@

      Parameters

      vertexOrId: V | VertexId

    Returns boolean

    +
  • Defined in src/interfaces/abstract-graph.ts:4

    • removeAllVertices

      @@ -212,7 +212,7 @@

      Parameters

      vertices: V[] | VertexId[]

    Returns boolean

    +
  • Defined in src/interfaces/abstract-graph.ts:10

    • removeEdge

      @@ -225,7 +225,7 @@

      Parameters

      edge: E

    Returns null | E

    +
  • Defined in src/interfaces/abstract-graph.ts:24

    • removeVertex

      @@ -238,7 +238,7 @@

      Parameters

      vertexOrId: V | VertexId

    Returns boolean

    +
  • Defined in src/interfaces/abstract-graph.ts:8

    • setEdgeWeight

      @@ -255,7 +255,7 @@
      destOrId: weight: number

    Returns boolean

    +
  • Defined in src/interfaces/abstract-graph.ts:26
    • diff --git a/docs/interfaces/IBST.html b/docs/interfaces/IBST.html index 3b8b202f..daf17366 100644 --- a/docs/interfaces/IBST.html +++ b/docs/interfaces/IBST.html @@ -34,7 +34,7 @@

    Implemented by

    +
  • Defined in src/interfaces/bst.ts:7
    • @@ -98,7 +98,7 @@

    loopTypeReturns LoopType

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:45

    • root

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:55

    • size

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:57

    • visitedId

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:47

    • visitedLeftSum

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:53

    • visitedNode

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:51

    • visitedVal

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:49

    • Methods

    @@ -163,7 +163,7 @@

    BFSReturns number[]

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:113
  • @@ -174,7 +174,7 @@
    nodeOrPropertyName: Returns number[]
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:115
  • @@ -185,7 +185,7 @@
    nodeOrPropertyName: Returns N["val"][]
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:117
  • @@ -196,7 +196,7 @@
    nodeOrPropertyName: Returns N[]
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:119
  • @@ -207,7 +207,7 @@
    nodeOrPropertyName: Returns number[]
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:121
  • @@ -218,7 +218,7 @@
    Optional Returns AbstractBinaryTreeNodeProperties<N>
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:123

    • DFS

  • @@ -240,7 +240,7 @@
    Optional Returns number[]
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:127
  • @@ -253,7 +253,7 @@
    Optional Returns N[]
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:129
  • @@ -266,7 +266,7 @@
    Optional Returns N[]
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:131
  • @@ -279,7 +279,7 @@
    Optional Returns number[]
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:133
  • @@ -292,7 +292,7 @@
    Optional Returns AbstractBinaryTreeNodeProperties<N>
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:135

    • DFSIterative

  • @@ -314,7 +314,7 @@
    Optional Returns number[]
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:139
  • @@ -327,7 +327,7 @@
    Optional Returns N[]
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:141
  • @@ -340,7 +340,7 @@
    Optional Returns N[]
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:143
  • @@ -353,7 +353,7 @@
    Optional Returns number[]
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:145
  • @@ -366,7 +366,7 @@
    Optional Returns AbstractBinaryTreeNodeProperties<N>
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:147

    • add

      @@ -384,7 +384,7 @@
      Optional Returns undefined | null | N
    +
  • Defined in src/interfaces/bst.ts:10

    • addMany

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:67

    • allGreaterNodesAdd

    Returns boolean

    +
  • Defined in src/interfaces/bst.ts:24

    • clear

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:61

    • createNode

    +
  • Defined in src/interfaces/bst.ts:8

    • fill

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:69

    • get

    +
  • Defined in src/interfaces/bst.ts:12

    • getDepth

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:73

    • getHeight

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:75

    • getLeftMost

  • @@ -524,7 +524,7 @@
    node: Returns N
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:91
  • @@ -535,7 +535,7 @@
    Optional Returns null | N
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:93

    • getMinHeight

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:77

    • getNodes

    +
  • Defined in src/interfaces/bst.ts:18

    • getPathToRoot

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:87

    • getPredecessor

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:176

    • getRightMost

  • @@ -615,7 +615,7 @@
    node: Returns N
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:97
  • @@ -626,7 +626,7 @@
    Optional Returns null | N
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:99

    • getSubTreeSize

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:105

    • has

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:83

    • isAVLBalanced

    +
  • Defined in src/interfaces/bst.ts:28

    • isBST

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:103

    • isEmpty

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:63

    • isPerfectlyBalanced

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:79

    • isSubtreeBST

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:101

    • lastKey

    +
  • Defined in src/interfaces/bst.ts:14

    • lesserSum

    Returns number

    +
  • Defined in src/interfaces/bst.ts:22

    • levelIterative

  • @@ -760,7 +760,7 @@
    Optional Returns number[]
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:154
  • @@ -773,7 +773,7 @@
    Optional Returns N["val"][]
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:156
  • @@ -786,7 +786,7 @@
    Optional Returns N[]
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:158
  • @@ -799,7 +799,7 @@
    Optional Returns number[]
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:160
  • @@ -812,7 +812,7 @@
    Optional Returns AbstractBinaryTreeNodeProperties<N>
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:162

    • listLevels

  • @@ -839,7 +839,7 @@
    Optional Returns number[][]
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:166
  • @@ -852,7 +852,7 @@
    Optional Returns N["val"][][]
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:168
  • @@ -865,7 +865,7 @@
    Optional Returns N[][]
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:170
  • @@ -878,7 +878,7 @@
    Optional Returns number[][]
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:172
  • @@ -891,7 +891,7 @@
    Optional Returns AbstractBinaryTreeNodeProperty<N>[][]
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:174

    • morris

  • @@ -913,7 +913,7 @@
    Optional Returns number[]
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:180
  • @@ -926,7 +926,7 @@
    Optional Returns N[]
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:182
  • @@ -939,7 +939,7 @@
    Optional Returns N[]
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:184
  • @@ -952,7 +952,7 @@
    Optional Returns number[]
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:186
  • @@ -965,7 +965,7 @@
    Optional Returns AbstractBinaryTreeNodeProperties<N>
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:188

    • perfectlyBalance

    +
  • Defined in src/interfaces/bst.ts:26

    • remove

    +
  • Defined in src/interfaces/bst.ts:16

    • subTreeAdd

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:111

    • subTreeSum

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:109

    • swapLocation

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:59
    • diff --git a/docs/interfaces/IDirectedGraph.html b/docs/interfaces/IDirectedGraph.html index 82f4ee89..93b22720 100644 --- a/docs/interfaces/IDirectedGraph.html +++ b/docs/interfaces/IDirectedGraph.html @@ -33,7 +33,7 @@

    Implemented by

    +
  • Defined in src/interfaces/directed-graph.ts:4
    • @@ -85,7 +85,7 @@
    val: Returns boolean
    +
  • Defined in src/interfaces/abstract-graph.ts:22

    • addVertex

    +
  • Defined in src/interfaces/abstract-graph.ts:6

    • degreeOf

    +
  • Defined in src/interfaces/abstract-graph.ts:12

    • edgeSet

    +
  • Defined in src/interfaces/abstract-graph.ts:20

    • edgesOf

    +
  • Defined in src/interfaces/abstract-graph.ts:14

    • getEdge

    +
  • Defined in src/interfaces/abstract-graph.ts:18

    • getEdgeDest

      @@ -167,7 +167,7 @@

      Parameters

      e: E

    Returns null | V

    +
  • Defined in src/interfaces/directed-graph.ts:15

    • getEdgeSrc

      @@ -180,7 +180,7 @@

      Parameters

      e: E

    Returns null | V

    +
  • Defined in src/interfaces/directed-graph.ts:13

    • getMinPathBetween

    +
  • Defined in src/interfaces/abstract-graph.ts:28

    • getNeighbors

    +
  • Defined in src/interfaces/abstract-graph.ts:30

    • hasEdge

    +
  • Defined in src/interfaces/abstract-graph.ts:16

    • hasVertex

    +
  • Defined in src/interfaces/abstract-graph.ts:4

    • inDegreeOf

      @@ -255,7 +255,7 @@

      Parameters

      vertexOrId: VertexId | V

    Returns number

    +
  • Defined in src/interfaces/directed-graph.ts:9

    • incomingEdgesOf

      @@ -268,7 +268,7 @@

      Parameters

      vertex: V

    Returns E[]

    +
  • Defined in src/interfaces/directed-graph.ts:5

    • outDegreeOf

      @@ -281,7 +281,7 @@

      Parameters

      vertexOrId: VertexId | V

    Returns number

    +
  • Defined in src/interfaces/directed-graph.ts:11

    • outgoingEdgesOf

      @@ -294,7 +294,7 @@

      Parameters

      vertex: V

    Returns E[]

    +
  • Defined in src/interfaces/directed-graph.ts:7

    • removeAllVertices

    +
  • Defined in src/interfaces/abstract-graph.ts:10

    • removeEdge

    +
  • Defined in src/interfaces/abstract-graph.ts:24

    • removeEdgeSrcToDest

    Returns null | E

    +
  • Defined in src/interfaces/directed-graph.ts:17

    • removeEdgesBetween

    Returns E[]

    +
  • Defined in src/interfaces/directed-graph.ts:19

    • removeVertex

    +
  • Defined in src/interfaces/abstract-graph.ts:8

    • setEdgeWeight

    +
  • Defined in src/interfaces/abstract-graph.ts:26
    • diff --git a/docs/interfaces/IRBTree.html b/docs/interfaces/IRBTree.html index dc60dec0..5606947a 100644 --- a/docs/interfaces/IRBTree.html +++ b/docs/interfaces/IRBTree.html @@ -31,7 +31,7 @@

    Implemented by

    +
  • Defined in src/interfaces/rb-tree.ts:7
    • @@ -95,7 +95,7 @@

    loopTypeReturns LoopType

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:45

    • root

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:55

    • size

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:57

    • visitedId

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:47

    • visitedLeftSum

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:53

    • visitedNode

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:51

    • visitedVal

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:49

    • Methods

    @@ -160,7 +160,7 @@

    BFSReturns number[]

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:113
  • @@ -171,7 +171,7 @@
    nodeOrPropertyName: Returns number[]
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:115
  • @@ -182,7 +182,7 @@
    nodeOrPropertyName: Returns N["val"][]
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:117
  • @@ -193,7 +193,7 @@
    nodeOrPropertyName: Returns N[]
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:119
  • @@ -204,7 +204,7 @@
    nodeOrPropertyName: Returns number[]
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:121
  • @@ -215,7 +215,7 @@
    Optional Returns AbstractBinaryTreeNodeProperties<N>
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:123

    • DFS

  • @@ -237,7 +237,7 @@
    Optional Returns number[]
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:127
  • @@ -250,7 +250,7 @@
    Optional Returns N[]
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:129
  • @@ -263,7 +263,7 @@
    Optional Returns N[]
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:131
  • @@ -276,7 +276,7 @@
    Optional Returns number[]
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:133
  • @@ -289,7 +289,7 @@
    Optional Returns AbstractBinaryTreeNodeProperties<N>
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:135

    • DFSIterative

  • @@ -311,7 +311,7 @@
    Optional Returns number[]
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:139
  • @@ -324,7 +324,7 @@
    Optional Returns N[]
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:141
  • @@ -337,7 +337,7 @@
    Optional Returns N[]
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:143
  • @@ -350,7 +350,7 @@
    Optional Returns number[]
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:145
  • @@ -363,7 +363,7 @@
    Optional Returns AbstractBinaryTreeNodeProperties<N>
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:147

    • add

    +
  • Defined in src/interfaces/bst.ts:10

    • addMany

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:67

    • allGreaterNodesAdd

    +
  • Defined in src/interfaces/bst.ts:24

    • clear

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:61

    • createNode

    +
  • Defined in src/interfaces/rb-tree.ts:8

    • fill

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:69

    • get

    +
  • Defined in src/interfaces/bst.ts:12

    • getDepth

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:73

    • getHeight

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:75

    • getLeftMost

  • @@ -522,7 +522,7 @@
    node: Returns N
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:91
  • @@ -533,7 +533,7 @@
    Optional Returns null | N
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:93

    • getMinHeight

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:77

    • getNodes

    +
  • Defined in src/interfaces/bst.ts:18

    • getPathToRoot

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:87

    • getPredecessor

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:176

    • getRightMost

  • @@ -613,7 +613,7 @@
    node: Returns N
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:97
  • @@ -624,7 +624,7 @@
    Optional Returns null | N
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:99

    • getSubTreeSize

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:105

    • has

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:83

    • isAVLBalanced

    +
  • Defined in src/interfaces/bst.ts:28

    • isBST

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:103

    • isEmpty

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:63

    • isPerfectlyBalanced

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:79

    • isSubtreeBST

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:101

    • lastKey

    +
  • Defined in src/interfaces/bst.ts:14

    • lesserSum

    +
  • Defined in src/interfaces/bst.ts:22

    • levelIterative

  • @@ -761,7 +761,7 @@
    Optional Returns number[]
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:154
  • @@ -774,7 +774,7 @@
    Optional Returns N["val"][]
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:156
  • @@ -787,7 +787,7 @@
    Optional Returns N[]
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:158
  • @@ -800,7 +800,7 @@
    Optional Returns number[]
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:160
  • @@ -813,7 +813,7 @@
    Optional Returns AbstractBinaryTreeNodeProperties<N>
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:162

    • listLevels

  • @@ -840,7 +840,7 @@
    Optional Returns number[][]
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:166
  • @@ -853,7 +853,7 @@
    Optional Returns N["val"][][]
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:168
  • @@ -866,7 +866,7 @@
    Optional Returns N[][]
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:170
  • @@ -879,7 +879,7 @@
    Optional Returns number[][]
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:172
  • @@ -892,7 +892,7 @@
    Optional Returns AbstractBinaryTreeNodeProperty<N>[][]
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:174

    • morris

  • @@ -914,7 +914,7 @@
    Optional Returns number[]
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:180
  • @@ -927,7 +927,7 @@
    Optional Returns N[]
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:182
  • @@ -940,7 +940,7 @@
    Optional Returns N[]
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:184
  • @@ -953,7 +953,7 @@
    Optional Returns number[]
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:186
  • @@ -966,7 +966,7 @@
    Optional Returns AbstractBinaryTreeNodeProperties<N>
    • +
  • Defined in src/interfaces/abstract-binary-tree.ts:188

    • perfectlyBalance

    +
  • Defined in src/interfaces/bst.ts:26

    • remove

    +
  • Defined in src/interfaces/bst.ts:16

    • subTreeAdd

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:111

    • subTreeSum

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:109

    • swapLocation

    +
  • Defined in src/interfaces/abstract-binary-tree.ts:59
    • diff --git a/docs/interfaces/IUNDirectedGraph.html b/docs/interfaces/IUNDirectedGraph.html index c89da129..dd4435dc 100644 --- a/docs/interfaces/IUNDirectedGraph.html +++ b/docs/interfaces/IUNDirectedGraph.html @@ -33,7 +33,7 @@

    Implemented by

    +
  • Defined in src/interfaces/undirected-graph.ts:4
    • @@ -78,7 +78,7 @@
    val: Returns boolean
    +
  • Defined in src/interfaces/abstract-graph.ts:22

    • addVertex

    +
  • Defined in src/interfaces/abstract-graph.ts:6

    • degreeOf

    +
  • Defined in src/interfaces/abstract-graph.ts:12

    • edgeSet

    +
  • Defined in src/interfaces/abstract-graph.ts:20

    • edgesOf

    +
  • Defined in src/interfaces/abstract-graph.ts:14

    • getEdge

    +
  • Defined in src/interfaces/abstract-graph.ts:18

    • getMinPathBetween

    +
  • Defined in src/interfaces/abstract-graph.ts:28

    • getNeighbors

    +
  • Defined in src/interfaces/abstract-graph.ts:30

    • hasEdge

    +
  • Defined in src/interfaces/abstract-graph.ts:16

    • hasVertex

    +
  • Defined in src/interfaces/abstract-graph.ts:4

    • removeAllVertices

    +
  • Defined in src/interfaces/abstract-graph.ts:10

    • removeEdge

    +
  • Defined in src/interfaces/abstract-graph.ts:24

    • removeEdgeBetween

    Returns null | E

    +
  • Defined in src/interfaces/undirected-graph.ts:5

    • removeVertex

    +
  • Defined in src/interfaces/abstract-graph.ts:8

    • setEdgeWeight

    +
  • Defined in src/interfaces/abstract-graph.ts:26
    • diff --git a/docs/types/AVLTreeNodeNested.html b/docs/types/AVLTreeNodeNested.html index c08abeab..6c6b0a35 100644 --- a/docs/types/AVLTreeNodeNested.html +++ b/docs/types/AVLTreeNodeNested.html @@ -22,7 +22,7 @@

    Type Parameters

  • T

    • +
  • Defined in src/types/data-structures/avl-tree.ts:4
    • diff --git a/docs/types/AVLTreeOptions.html b/docs/types/AVLTreeOptions.html index 0d71e41f..7fa42c18 100644 --- a/docs/types/AVLTreeOptions.html +++ b/docs/types/AVLTreeOptions.html @@ -20,7 +20,7 @@

    Type alias AVLTreeOptions

    Type declaration

      +
    • Defined in src/types/data-structures/avl-tree.ts:5
      • diff --git a/docs/types/AbstractBinaryTreeNodeNested.html b/docs/types/AbstractBinaryTreeNodeNested.html index 4c8b8d6d..c3911327 100644 --- a/docs/types/AbstractBinaryTreeNodeNested.html +++ b/docs/types/AbstractBinaryTreeNodeNested.html @@ -22,7 +22,7 @@

      Type Parameters

    • T

      • +
    • Defined in src/types/data-structures/abstract-binary-tree.ts:46
      • diff --git a/docs/types/AbstractBinaryTreeNodeProperties.html b/docs/types/AbstractBinaryTreeNodeProperties.html index b34e3508..3c157583 100644 --- a/docs/types/AbstractBinaryTreeNodeProperties.html +++ b/docs/types/AbstractBinaryTreeNodeProperties.html @@ -22,7 +22,7 @@

      Type Parameters

    • N extends AbstractBinaryTreeNode<N["val"], N>

      • +
    • Defined in src/types/data-structures/abstract-binary-tree.ts:43
      • diff --git a/docs/types/AbstractBinaryTreeNodeProperty.html b/docs/types/AbstractBinaryTreeNodeProperty.html index 42ad98b8..5637e152 100644 --- a/docs/types/AbstractBinaryTreeNodeProperty.html +++ b/docs/types/AbstractBinaryTreeNodeProperty.html @@ -22,7 +22,7 @@

      Type Parameters

    • N extends AbstractBinaryTreeNode<N["val"], N>

      • +
    • Defined in src/types/data-structures/abstract-binary-tree.ts:36
      • diff --git a/docs/types/AbstractBinaryTreeOptions.html b/docs/types/AbstractBinaryTreeOptions.html index 017877ea..b1091647 100644 --- a/docs/types/AbstractBinaryTreeOptions.html +++ b/docs/types/AbstractBinaryTreeOptions.html @@ -22,7 +22,7 @@

      Type declaration

    • Optional loopType?: LoopType
      • +
    • Defined in src/types/data-structures/abstract-binary-tree.ts:48
      • diff --git a/docs/types/BSTComparator.html b/docs/types/BSTComparator.html index a554188d..1499d5ca 100644 --- a/docs/types/BSTComparator.html +++ b/docs/types/BSTComparator.html @@ -32,7 +32,7 @@
      a: b: BinaryTreeNodeId

      Returns number

      +
    • Defined in src/types/data-structures/bst.ts:5
      • diff --git a/docs/types/BSTNodeNested.html b/docs/types/BSTNodeNested.html index ce3aea38..2da0c75c 100644 --- a/docs/types/BSTNodeNested.html +++ b/docs/types/BSTNodeNested.html @@ -22,7 +22,7 @@

      Type Parameters

    • T

      • +
    • Defined in src/types/data-structures/bst.ts:8
      • diff --git a/docs/types/BSTOptions.html b/docs/types/BSTOptions.html index 9469aa61..4ef10255 100644 --- a/docs/types/BSTOptions.html +++ b/docs/types/BSTOptions.html @@ -22,7 +22,7 @@

      Type declaration

    • Optional comparator?: BSTComparator
      • +
    • Defined in src/types/data-structures/bst.ts:9
      • diff --git a/docs/types/BinaryTreeDeletedResult.html b/docs/types/BinaryTreeDeletedResult.html index f3fe0dba..a15e0c96 100644 --- a/docs/types/BinaryTreeDeletedResult.html +++ b/docs/types/BinaryTreeDeletedResult.html @@ -29,7 +29,7 @@
      deleted
      needBalanced: N | null
      +
    • Defined in src/types/data-structures/abstract-binary-tree.ts:34
      • diff --git a/docs/types/BinaryTreeNodeId.html b/docs/types/BinaryTreeNodeId.html index f83dd5ba..99d30f01 100644 --- a/docs/types/BinaryTreeNodeId.html +++ b/docs/types/BinaryTreeNodeId.html @@ -17,7 +17,7 @@

      Type alias BinaryTreeNodeId

      BinaryTreeNodeId: number
      +
    • Defined in src/types/data-structures/abstract-binary-tree.ts:32
      • diff --git a/docs/types/BinaryTreeNodeNested.html b/docs/types/BinaryTreeNodeNested.html index 43f43e7d..bd9b1d23 100644 --- a/docs/types/BinaryTreeNodeNested.html +++ b/docs/types/BinaryTreeNodeNested.html @@ -22,7 +22,7 @@

      Type Parameters

    • T

      • +
    • Defined in src/types/data-structures/binary-tree.ts:4
      • diff --git a/docs/types/BinaryTreeNodePropertyName.html b/docs/types/BinaryTreeNodePropertyName.html index 6ed30d1a..8ed61297 100644 --- a/docs/types/BinaryTreeNodePropertyName.html +++ b/docs/types/BinaryTreeNodePropertyName.html @@ -17,7 +17,7 @@

      Type alias BinaryTreeNodePropertyName

      BinaryTreeNodePropertyName: "id" | "val"
      +
    • Defined in src/types/data-structures/abstract-binary-tree.ts:26
      • diff --git a/docs/types/BinaryTreeOptions.html b/docs/types/BinaryTreeOptions.html index 09c37288..9aeba021 100644 --- a/docs/types/BinaryTreeOptions.html +++ b/docs/types/BinaryTreeOptions.html @@ -20,7 +20,7 @@

      Type alias BinaryTreeOptions

      Type declaration

        +
      • Defined in src/types/data-structures/binary-tree.ts:5
        • diff --git a/docs/types/DFSOrderPattern.html b/docs/types/DFSOrderPattern.html index 6276c5c5..38910a7c 100644 --- a/docs/types/DFSOrderPattern.html +++ b/docs/types/DFSOrderPattern.html @@ -17,7 +17,7 @@

        Type alias DFSOrderPattern

        DFSOrderPattern: "in" | "pre" | "post"
        +
      • Defined in src/types/data-structures/abstract-binary-tree.ts:30
        • diff --git a/docs/types/DijkstraResult.html b/docs/types/DijkstraResult.html index c56a7cb7..63bddfbb 100644 --- a/docs/types/DijkstraResult.html +++ b/docs/types/DijkstraResult.html @@ -39,7 +39,7 @@
        preMap
        seen: Set<V>
        +
      • Defined in src/types/data-structures/abstract-graph.ts:3
        • diff --git a/docs/types/Direction.html b/docs/types/Direction.html index ceb11b90..aea54ec1 100644 --- a/docs/types/Direction.html +++ b/docs/types/Direction.html @@ -17,7 +17,7 @@

        Type alias Direction

        Direction: "up" | "right" | "down" | "left"
        +
      • Defined in src/types/data-structures/navigator.ts:1
        • diff --git a/docs/types/DummyAny.html b/docs/types/DummyAny.html index 1db5952e..6d4f948d 100644 --- a/docs/types/DummyAny.html +++ b/docs/types/DummyAny.html @@ -30,7 +30,7 @@

        Parameters

        Rest ...args: []

        Returns any

        +
      • Defined in src/types/utils/validate-type.ts:25
        • diff --git a/docs/types/EdgeId.html b/docs/types/EdgeId.html index 52959f44..2d6f7c1d 100644 --- a/docs/types/EdgeId.html +++ b/docs/types/EdgeId.html @@ -17,7 +17,7 @@

        Type alias EdgeId

        EdgeId: string
        +
      • Defined in src/types/data-structures/abstract-graph.ts:2
        • diff --git a/docs/types/HeapOptions.html b/docs/types/HeapOptions.html index eef58198..a43444b9 100644 --- a/docs/types/HeapOptions.html +++ b/docs/types/HeapOptions.html @@ -38,7 +38,7 @@

        Parameters

        element: T

        Returns number

        +
      • Defined in src/types/data-structures/heap.ts:1
        • diff --git a/docs/types/IAVLTreeNode.html b/docs/types/IAVLTreeNode.html index 31910822..fc9231a7 100644 --- a/docs/types/IAVLTreeNode.html +++ b/docs/types/IAVLTreeNode.html @@ -24,7 +24,7 @@

        T

      • NEIGHBOR extends IAVLTreeNode<T, NEIGHBOR>

        • +
      • Defined in src/interfaces/avl-tree.ts:5
        • diff --git a/docs/types/IBSTNode.html b/docs/types/IBSTNode.html index 7fd9b5ff..7645d36a 100644 --- a/docs/types/IBSTNode.html +++ b/docs/types/IBSTNode.html @@ -24,7 +24,7 @@

        T

      • NEIGHBOR extends IBSTNode<T, NEIGHBOR>

        • +
      • Defined in src/interfaces/bst.ts:5
        • diff --git a/docs/types/IBinaryTree.html b/docs/types/IBinaryTree.html index 4e79d53e..b8349966 100644 --- a/docs/types/IBinaryTree.html +++ b/docs/types/IBinaryTree.html @@ -22,7 +22,7 @@

        Type Parameters

      • N extends BinaryTreeNode<N["val"], N>

        • +
      • Defined in src/interfaces/binary-tree.ts:6
        • diff --git a/docs/types/IBinaryTreeNode.html b/docs/types/IBinaryTreeNode.html index 8db017f9..f537e4c2 100644 --- a/docs/types/IBinaryTreeNode.html +++ b/docs/types/IBinaryTreeNode.html @@ -24,7 +24,7 @@

        T

      • NEIGHBOR extends IBinaryTreeNode<T, NEIGHBOR>

        • +
      • Defined in src/interfaces/binary-tree.ts:4
        • diff --git a/docs/types/IRBTreeNode.html b/docs/types/IRBTreeNode.html index 971dd3cd..8fa2b2c5 100644 --- a/docs/types/IRBTreeNode.html +++ b/docs/types/IRBTreeNode.html @@ -24,7 +24,7 @@

        T

      • NEIGHBOR extends IRBTreeNode<T, NEIGHBOR>

        • +
      • Defined in src/interfaces/rb-tree.ts:5
        • diff --git a/docs/types/ITreeMultiset.html b/docs/types/ITreeMultiset.html index 59421f88..30a05955 100644 --- a/docs/types/ITreeMultiset.html +++ b/docs/types/ITreeMultiset.html @@ -22,7 +22,7 @@

        Type Parameters

      • N extends TreeMultisetNode<N["val"], N>

        • +
      • Defined in src/interfaces/tree-multiset.ts:7
        • diff --git a/docs/types/ITreeMultisetNode.html b/docs/types/ITreeMultisetNode.html index 36a009e5..ccd877dd 100644 --- a/docs/types/ITreeMultisetNode.html +++ b/docs/types/ITreeMultisetNode.html @@ -24,7 +24,7 @@

        T

      • NEIGHBOR extends ITreeMultisetNode<T, NEIGHBOR>

        • +
      • Defined in src/interfaces/tree-multiset.ts:5
        • diff --git a/docs/types/KeyValueObject.html b/docs/types/KeyValueObject.html index f612a5df..daecbf3e 100644 --- a/docs/types/KeyValueObject.html +++ b/docs/types/KeyValueObject.html @@ -22,7 +22,7 @@

        Type declaration

      • [key: string]: any
        • +
      • Defined in src/types/utils/validate-type.ts:1
        • diff --git a/docs/types/KeyValueObjectWithId.html b/docs/types/KeyValueObjectWithId.html index 37a9b919..1edf39a6 100644 --- a/docs/types/KeyValueObjectWithId.html +++ b/docs/types/KeyValueObjectWithId.html @@ -24,7 +24,7 @@
        [
      • id: string | number | symbol
        • +
      • Defined in src/types/utils/validate-type.ts:3
        • diff --git a/docs/types/MapGraphCoordinate.html b/docs/types/MapGraphCoordinate.html index 9d469141..ea792fa0 100644 --- a/docs/types/MapGraphCoordinate.html +++ b/docs/types/MapGraphCoordinate.html @@ -17,7 +17,7 @@

        Type alias MapGraphCoordinate

        MapGraphCoordinate: [number, number]
        +
      • Defined in src/types/data-structures/map-graph.ts:1
        • diff --git a/docs/types/NavigatorParams.html b/docs/types/NavigatorParams.html index 4858c409..aaf92870 100644 --- a/docs/types/NavigatorParams.html +++ b/docs/types/NavigatorParams.html @@ -51,7 +51,7 @@

        Returns void
        turning: Turning

        +
      • Defined in src/types/data-structures/navigator.ts:4
        • diff --git a/docs/types/NodeOrPropertyName.html b/docs/types/NodeOrPropertyName.html index 5c124cd9..9b3ec1b0 100644 --- a/docs/types/NodeOrPropertyName.html +++ b/docs/types/NodeOrPropertyName.html @@ -17,7 +17,7 @@

        Type alias NodeOrPropertyName

        NodeOrPropertyName: "node" | BinaryTreeNodePropertyName
        +
      • Defined in src/types/data-structures/abstract-binary-tree.ts:28
        • diff --git a/docs/types/NonNumberNonObjectButDefined.html b/docs/types/NonNumberNonObjectButDefined.html index fe69b15b..9bf6a552 100644 --- a/docs/types/NonNumberNonObjectButDefined.html +++ b/docs/types/NonNumberNonObjectButDefined.html @@ -17,7 +17,7 @@

        Type alias NonNumberNonObjectButDefined

        NonNumberNonObjectButDefined: string | boolean | symbol | null
        +
      • Defined in src/types/utils/validate-type.ts:5
        • diff --git a/docs/types/ObjectWithNonNumberId.html b/docs/types/ObjectWithNonNumberId.html index f6061e2b..3841e68b 100644 --- a/docs/types/ObjectWithNonNumberId.html +++ b/docs/types/ObjectWithNonNumberId.html @@ -24,7 +24,7 @@
        [
      • id: string | boolean | symbol | null | object | undefined
        • +
      • Defined in src/types/utils/validate-type.ts:9
        • diff --git a/docs/types/ObjectWithNumberId.html b/docs/types/ObjectWithNumberId.html index c05a14f6..cb53c4ec 100644 --- a/docs/types/ObjectWithNumberId.html +++ b/docs/types/ObjectWithNumberId.html @@ -24,7 +24,7 @@
        [
      • id: number
        • +
      • Defined in src/types/utils/validate-type.ts:14
        • diff --git a/docs/types/ObjectWithoutId.html b/docs/types/ObjectWithoutId.html index f7aea243..84896c20 100644 --- a/docs/types/ObjectWithoutId.html +++ b/docs/types/ObjectWithoutId.html @@ -17,7 +17,7 @@

        Type alias ObjectWithoutId

        ObjectWithoutId: Omit<KeyValueObject, "id">
        +
      • Defined in src/types/utils/validate-type.ts:7
        • diff --git a/docs/types/PriorityQueueComparator.html b/docs/types/PriorityQueueComparator.html index 16e4b7ff..704d3954 100644 --- a/docs/types/PriorityQueueComparator.html +++ b/docs/types/PriorityQueueComparator.html @@ -37,7 +37,7 @@
        a: b: T

        Returns number

        +
      • Defined in src/types/data-structures/priority-queue.ts:1
        • diff --git a/docs/types/PriorityQueueDFSOrderPattern.html b/docs/types/PriorityQueueDFSOrderPattern.html index 09e38e40..08e81ca5 100644 --- a/docs/types/PriorityQueueDFSOrderPattern.html +++ b/docs/types/PriorityQueueDFSOrderPattern.html @@ -17,7 +17,7 @@

        Type alias PriorityQueueDFSOrderPattern

        PriorityQueueDFSOrderPattern: "pre" | "in" | "post"
        +
      • Defined in src/types/data-structures/priority-queue.ts:9
        • diff --git a/docs/types/PriorityQueueOptions.html b/docs/types/PriorityQueueOptions.html index 85c6ff07..ffeaee74 100644 --- a/docs/types/PriorityQueueOptions.html +++ b/docs/types/PriorityQueueOptions.html @@ -31,7 +31,7 @@
        Optional
        Optional nodes?: T[]
        +
      • Defined in src/types/data-structures/priority-queue.ts:3
        • diff --git a/docs/types/RBTreeNodeNested.html b/docs/types/RBTreeNodeNested.html index 10dfcfbe..49751767 100644 --- a/docs/types/RBTreeNodeNested.html +++ b/docs/types/RBTreeNodeNested.html @@ -22,7 +22,7 @@

        Type Parameters

      • T

        • +
      • Defined in src/types/data-structures/rb-tree.ts:6
        • diff --git a/docs/types/RBTreeOptions.html b/docs/types/RBTreeOptions.html index 59e24c42..7ef29643 100644 --- a/docs/types/RBTreeOptions.html +++ b/docs/types/RBTreeOptions.html @@ -20,7 +20,7 @@

        Type alias RBTreeOptions

        Type declaration

          +
        • Defined in src/types/data-structures/rb-tree.ts:8
          • diff --git a/docs/types/RestrictValById.html b/docs/types/RestrictValById.html index 34db1f51..61f58bd9 100644 --- a/docs/types/RestrictValById.html +++ b/docs/types/RestrictValById.html @@ -17,7 +17,7 @@

          Type alias RestrictValById

          RestrictValById: NonNumberNonObjectButDefined | ObjectWithoutId | ObjectWithNonNumberId | ObjectWithNumberId
          +
        • Defined in src/types/utils/validate-type.ts:19
          • diff --git a/docs/types/SegmentTreeNodeVal.html b/docs/types/SegmentTreeNodeVal.html index affe6f16..c806d6d5 100644 --- a/docs/types/SegmentTreeNodeVal.html +++ b/docs/types/SegmentTreeNodeVal.html @@ -17,7 +17,7 @@

          Type alias SegmentTreeNodeVal

          SegmentTreeNodeVal: number
          +
        • Defined in src/types/data-structures/segment-tree.ts:1
          • diff --git a/docs/types/SpecifyOptional.html b/docs/types/SpecifyOptional.html index e054dbb5..2a6e6e6d 100644 --- a/docs/types/SpecifyOptional.html +++ b/docs/types/SpecifyOptional.html @@ -24,7 +24,7 @@

          T

        • K extends keyof T

          • +
        • Defined in src/types/utils/utils.ts:6
          • diff --git a/docs/types/Thunk.html b/docs/types/Thunk.html index 73a3e0e6..cd3a6f48 100644 --- a/docs/types/Thunk.html +++ b/docs/types/Thunk.html @@ -25,7 +25,7 @@

          Type declaration

        • Returns ReturnType<ToThunkFn> & {
              __THUNK__: symbol;
          }

          • +
        • Defined in src/types/utils/utils.ts:2
          • diff --git a/docs/types/ToThunkFn.html b/docs/types/ToThunkFn.html index e4752917..a8f6d2ba 100644 --- a/docs/types/ToThunkFn.html +++ b/docs/types/ToThunkFn.html @@ -25,7 +25,7 @@

          Type declaration

        • Returns ReturnType<TrlFn>

          • +
        • Defined in src/types/utils/utils.ts:1
          • diff --git a/docs/types/TopologicalStatus.html b/docs/types/TopologicalStatus.html index 8138d7af..277e0383 100644 --- a/docs/types/TopologicalStatus.html +++ b/docs/types/TopologicalStatus.html @@ -17,7 +17,7 @@

          Type alias TopologicalStatus

          TopologicalStatus: 0 | 1 | 2
          +
        • Defined in src/types/data-structures/directed-graph.ts:2
          • diff --git a/docs/types/TreeMultisetNodeNested.html b/docs/types/TreeMultisetNodeNested.html index 53c2676c..ba27b0f7 100644 --- a/docs/types/TreeMultisetNodeNested.html +++ b/docs/types/TreeMultisetNodeNested.html @@ -22,7 +22,7 @@

          Type Parameters

        • T

          • +
        • Defined in src/types/data-structures/tree-multiset.ts:4
          • diff --git a/docs/types/TreeMultisetOptions.html b/docs/types/TreeMultisetOptions.html index 67df1f1c..7eceea94 100644 --- a/docs/types/TreeMultisetOptions.html +++ b/docs/types/TreeMultisetOptions.html @@ -20,7 +20,7 @@

          Type alias TreeMultisetOptions

          Type declaration

            +
          • Defined in src/types/data-structures/tree-multiset.ts:6
            • diff --git a/docs/types/TrlAsyncFn.html b/docs/types/TrlAsyncFn.html index 89565f33..b4bff4fd 100644 --- a/docs/types/TrlAsyncFn.html +++ b/docs/types/TrlAsyncFn.html @@ -30,7 +30,7 @@

            Parameters

            Rest ...args: any[]

            Returns any

            +
          • Defined in src/types/utils/utils.ts:4
            • diff --git a/docs/types/TrlFn.html b/docs/types/TrlFn.html index ba35315e..c1aa361f 100644 --- a/docs/types/TrlFn.html +++ b/docs/types/TrlFn.html @@ -30,7 +30,7 @@

            Parameters

            Rest ...args: any[]

            Returns any

            +
          • Defined in src/types/utils/utils.ts:3
            • diff --git a/docs/types/Turning.html b/docs/types/Turning.html index 8860b456..b5639be5 100644 --- a/docs/types/Turning.html +++ b/docs/types/Turning.html @@ -17,7 +17,7 @@

            Type alias Turning

            Turning: {
                [key in Direction]: Direction
            }
            +
          • Defined in src/types/data-structures/navigator.ts:2
            • diff --git a/docs/types/VertexId.html b/docs/types/VertexId.html index b49b219a..b1400ab1 100644 --- a/docs/types/VertexId.html +++ b/docs/types/VertexId.html @@ -17,7 +17,7 @@

            Type alias VertexId

            VertexId: string | number
            +
          • Defined in src/types/data-structures/abstract-graph.ts:1
            • diff --git a/docs/variables/THUNK_SYMBOL.html b/docs/variables/THUNK_SYMBOL.html index a6cf9710..8351d341 100644 --- a/docs/variables/THUNK_SYMBOL.html +++ b/docs/variables/THUNK_SYMBOL.html @@ -17,7 +17,7 @@

            Variable THUNK_SYMBOLConst

            THUNK_SYMBOL: typeof THUNK_SYMBOL = ...
            +
          • Defined in src/utils/utils.ts:35
            • diff --git a/package.json b/package.json index 1c6a9b82..12491d5a 100644 --- a/package.json +++ b/package.json @@ -1,7 +1,7 @@ { "name": "data-structure-typed", "version": "1.32.1", - "description": "Data Structures of Javascript & TypeScript. AVLTree, Binary Search Tree, Binary Tree, Tree Multiset, Graph, Heap, Priority Queue, Linked List.", + "description": "Data Structures of Javascript & TypeScript. Binary Tree, BST, Graph, Heap, Priority Queue, Linked List, Queue, Deque, Stack, AVL Tree, Tree Multiset, Trie, Directed Graph, Undirected Graph, Singly Linked List, Doubly Linked List, Max Heap, Max Priority Queue, Min Heap, Min Priority Queue.", "main": "dist/index.js", "module": "lib/index.js", "types": "lib/index.d.ts",