min-heap-typed 1.42.8 → 1.42.9

package/dist/data-structures/binary-tree/tree-multimap.js

@@ -50,17 +50,22 @@ class TreeMultimap extends avl_tree_1.AVLTree {
         return new TreeMultimapNode(key, value, count);
     }
     /**
-     * The `add` function adds a new node to a binary search tree, updating the count if the key already
-     * exists, and balancing the tree if necessary.
-     * @param {BTNKey | N | undefined} keyOrNode - The `keyOrNode` parameter can be either a
-     * `BTNKey` (which represents the key of the node to be added), a `N` (which represents a
-     * node to be added), or `undefined` (which represents a undefined node).
-     * @param [value] - The `value` parameter represents the value associated with the key that is being
-     * added to the binary tree.
-     * @param [count=1] - The `count` parameter represents the number of occurrences of the key/value
-     * pair that will be added to the binary tree. It has a default value of 1, which means that if no
-     * count is specified, the default count will be 1.
-     * @returns The function `add` returns a value of type `N | undefined | undefined`.
+     * Time Complexity: O(log n) - logarithmic time, where "n" is the number of nodes in the tree. The add method of the superclass (AVLTree) has logarithmic time complexity.
+     * Space Complexity: O(1) - constant space, as it doesn't use additional data structures that scale with input size.
+     */
+    /**
+     * Time Complexity: O(log n) - logarithmic time, where "n" is the number of nodes in the tree. The add method of the superclass (AVLTree) has logarithmic time complexity.
+     * Space Complexity: O(1) - constant space, as it doesn't use additional data structures that scale with input size.
+     *
+     * The `add` function adds a new node to the tree multimap, updating the count if the key already
+     * exists, and balances the tree if necessary.
+     * @param {BTNKey | N | null | undefined} keyOrNode - The `keyOrNode` parameter can be one of the
+     * following types:
+     * @param {V} [value] - The `value` parameter represents the value associated with the key that is
+     * being added to the tree. It is an optional parameter, so it can be omitted if not needed.
+     * @param [count=1] - The `count` parameter is an optional parameter that specifies the number of
+     * times the key-value pair should be added to the multimap. If not provided, the default value is 1.
+     * @returns a node (`N`) or `undefined`.
      */
     add(keyOrNode, value, count = 1) {
         if (keyOrNode === null)
@@ -142,12 +147,23 @@ class TreeMultimap extends avl_tree_1.AVLTree {
         return inserted;
     }
     /**
-     * The function adds a new node to a binary tree if there is an available slot in the parent node.
-     * @param {N | undefined} newNode - The `newNode` parameter represents the node that needs to be added to
-     * the tree. It can be either a node object (`N`) or `undefined`.
-     * @param {N} parent - The `parent` parameter represents the parent node to which the new node will
-     * be added as a child.
-     * @returns The method `_addTo` returns either the `parent.left`, `parent.right`, or `undefined`.
+     * Time Complexity: O(1) - constant time, as it performs basic pointer assignments.
+     * Space Complexity: O(1) - constant space, as it only uses a constant amount of memory.
+     */
+    /**
+     * Time Complexity: O(1) - constant time, as it performs basic pointer assignments.
+     * Space Complexity: O(1) - constant space, as it only uses a constant amount of memory.
+     *
+     * The function adds a new node to a binary tree, either as the left child or the right child of a
+     * given parent node.
+     * @param {N | undefined} newNode - The `newNode` parameter represents the node that needs to be
+     * added to the binary tree. It can be of type `N` (which represents a node in the binary tree) or
+     * `undefined` if there is no node to add.
+     * @param {BTNKey | N | undefined} parent - The `parent` parameter represents the parent node to
+     * which the new node will be added as a child. It can be either a node object (`N`) or a key value
+     * (`BTNKey`).
+     * @returns The method `_addTo` returns either the `parent.left` or `parent.right` node that was
+     * added, or `undefined` if no node was added.
      */
     _addTo(newNode, parent) {
         parent = this.ensureNotKey(parent);
@@ -177,14 +193,21 @@ class TreeMultimap extends avl_tree_1.AVLTree {
         }
     }
     /**
-     * The `addMany` function adds multiple keys or nodes to a TreeMultimap and returns an array of the
-     * inserted nodes.
-     * @param {(BTNKey | undefined)[] | (N | undefined)[]} keysOrNodes - An array of keys or nodes to be
-     * added to the multiset. Each element can be either a BTNKey or a TreeMultimapNode.
-     * @param {V[]} [data] - The `data` parameter is an optional array of values that correspond
-     * to the keys or nodes being added to the multiset. It is used to associate additional data with
-     * each key or node.
-     * @returns The function `addMany` returns an array of `N`, `undefined`, or `undefined` values.
+     * Time Complexity: O(k log n) - logarithmic time for each insertion, where "n" is the number of nodes in the tree, and "k" is the number of keys to be inserted. This is because the method iterates through the keys and calls the add method for each.
+     * Space Complexity: O(1) - constant space, as it doesn't use additional data structures that scale with input size.
+     */
+    /**
+     * Time Complexity: O(k log n) - logarithmic time for each insertion, where "n" is the number of nodes in the tree, and "k" is the number of keys to be inserted. This is because the method iterates through the keys and calls the add method for each.
+     * Space Complexity: O(1) - constant space, as it doesn't use additional data structures that scale with input size.
+     *
+     * The function `addMany` takes an array of keys or nodes and adds them to the TreeMultimap,
+     * returning an array of the inserted nodes.
+     * @param {(BTNKey | N | undefined)[]} keysOrNodes - An array of keys or nodes. Each element can be
+     * of type BTNKey, N, or undefined.
+     * @param {V[]} [data] - The `data` parameter is an optional array of values that correspond to the
+     * keys or nodes being added. It is used to associate data with each key or node being added to the
+     * TreeMultimap. If provided, the length of the `data` array should be the same as the length of the
+     * @returns The function `addMany` returns an array of nodes (`N`) or `undefined` values.
      */
     addMany(keysOrNodes, data) {
         const inserted = [];
@@ -203,10 +226,17 @@ class TreeMultimap extends avl_tree_1.AVLTree {
         return inserted;
     }
     /**
-     * The `perfectlyBalance` function in TypeScript takes a sorted array of nodes and builds a balanced
-     * binary search tree using either a recursive or iterative approach.
+     * Time Complexity: O(n log n) - logarithmic time for each insertion, where "n" is the number of nodes in the tree. This is because the method calls the add method for each node.
+     * Space Complexity: O(n) - linear space, as it creates an array to store the sorted nodes.
+     */
+    /**
+     * Time Complexity: O(n log n) - logarithmic time for each insertion, where "n" is the number of nodes in the tree. This is because the method calls the add method for each node.
+     * Space Complexity: O(n) - linear space, as it creates an array to store the sorted nodes.
+     *
+     * The `perfectlyBalance` function takes a sorted array of nodes and builds a balanced binary search
+     * tree using either a recursive or iterative approach.
      * @param iterationType - The `iterationType` parameter is an optional parameter that specifies the
-     * type of iteration to use when building a balanced binary search tree. It can have two possible
+     * type of iteration to use when building the balanced binary search tree. It can have two possible
      * values:
      * @returns a boolean value.
      */
@@ -247,20 +277,27 @@ class TreeMultimap extends avl_tree_1.AVLTree {
         }
     }
     /**
-     * The `delete` function in a binary search tree deletes a node from the tree and returns the deleted
-     * node along with the parent node that needs to be balanced.
-     * @param {ReturnType<C>} identifier - The `identifier` parameter is either a
-     * `BTNKey` or a generic type `N`. It represents the property of the node that we are
-     * searching for. It can be a specific key value or any other property of the node.
-     * @param callback - The `callback` parameter is a function that takes a node as input and returns a
-     * value. This value is compared with the `identifier` parameter to determine if the node should be
-     * included in the result. The `callback` parameter has a default value of
-     * `this._defaultOneParamCallback`
+     * Time Complexity: O(log n) - logarithmic time, where "n" is the number of nodes in the tree. The delete method of the superclass (AVLTree) has logarithmic time complexity.
+     * Space Complexity: O(1) - constant space, as it doesn't use additional data structures that scale with input size.
+     */
+    /**
+     * Time Complexity: O(log n) - logarithmic time, where "n" is the number of nodes in the tree. The delete method of the superclass (AVLTree) has logarithmic time complexity.
+     * Space Complexity: O(1) - constant space, as it doesn't use additional data structures that scale with input size.
+     *
+     * The `delete` function in TypeScript is used to remove a node from a binary tree, taking into
+     * account the count of the node and balancing the tree if necessary.
+     * @param identifier - The identifier is the value or key that is used to identify the node that
+     * needs to be deleted from the binary tree. It can be of any type that is returned by the callback
+     * function.
+     * @param {C} callback - The `callback` parameter is a function that is used to determine if a node
+     * should be deleted. It is optional and defaults to a default callback function. The `callback`
+     * function takes one parameter, which is the identifier of the node, and returns a value that is
+     * used to identify the node to
      * @param [ignoreCount=false] - A boolean flag indicating whether to ignore the count of the node
      * being deleted. If set to true, the count of the node will not be considered and the node will be
      * deleted regardless of its count. If set to false (default), the count of the node will be
      * decremented by 1 and
-     * @returns The method `delete` returns an array of `BiTreeDeleteResult<N>` objects.
+     * @returns an array of `BiTreeDeleteResult<N>`.
      */
     delete(identifier, callback = this._defaultOneParamCallback, ignoreCount = false) {
         var _a;
@@ -328,11 +365,13 @@ class TreeMultimap extends avl_tree_1.AVLTree {
         this._count = 0;
     }
     /**
-     * The function swaps the values of two nodes in a binary tree.
-     * @param {N} srcNode - The source node that needs to be swapped with the destination node.
-     * @param {N} destNode - The `destNode` parameter represents the destination node where the values
-     * from `srcNode` will be swapped into.
-     * @returns The method is returning the `destNode` after swapping its properties with the `srcNode`.
+     * The `_swap` function swaps the key, value, count, and height properties between two nodes.
+     * @param {BTNKey | N | undefined} srcNode - The `srcNode` parameter represents the source node from
+     * which the values will be swapped. It can be of type `BTNKey`, `N`, or `undefined`.
+     * @param {BTNKey | N | undefined} destNode - The `destNode` parameter represents the destination
+     * node where the values from the source node will be swapped to.
+     * @returns either the `destNode` object if both `srcNode` and `destNode` are defined, or `undefined`
+     * if either `srcNode` or `destNode` is undefined.
      */
     _swap(srcNode, destNode) {
         srcNode = this.ensureNotKey(srcNode);

package/dist/data-structures/graph/abstract-graph.d.ts

@@ -55,6 +55,13 @@ export declare abstract class AbstractGraph<V = any, E = any, VO extends Abstrac
     abstract getNeighbors(vertexOrKey: VO | VertexKey): VO[];
     abstract getEndsOfEdge(edge: EO): [VO, VO] | null;
     /**
+     * Time Complexity: O(1) - Constant time for Map lookup.
+     * Space Complexity: O(1) - Constant space, as it creates only a few variables.
+     */
+    /**
+     * Time Complexity: O(1) - Constant time for Map lookup.
+     * Space Complexity: O(1) - Constant space, as it creates only a few variables.
+     *
      * The function "getVertex" returns the vertex with the specified ID or null if it doesn't exist.
      * @param {VertexKey} vertexKey - The `vertexKey` parameter is the identifier of the vertex that you want to retrieve from
      * the `_vertices` map.
@@ -63,6 +70,13 @@ export declare abstract class AbstractGraph<V = any, E = any, VO extends Abstrac
      */
     getVertex(vertexKey: VertexKey): VO | null;
     /**
+     * Time Complexity: O(1) - Constant time for Map lookup.
+     * Space Complexity: O(1) - Constant space, as it creates only a few variables.
+     */
+    /**
+     * Time Complexity: O(1) - Constant time for Map lookup.
+     * Space Complexity: O(1) - Constant space, as it creates only a few variables.
+     *
      * The function checks if a vertex exists in a graph.
      * @param {VO | VertexKey} vertexOrKey - The parameter `vertexOrKey` can be either a vertex object (`VO`) or a vertex ID
      * (`VertexKey`).
@@ -72,6 +86,13 @@ export declare abstract class AbstractGraph<V = any, E = any, VO extends Abstrac
     addVertex(vertex: VO): boolean;
     addVertex(key: VertexKey, value?: V): boolean;
     /**
+     * Time Complexity: O(1) - Constant time for Map operations.
+     * Space Complexity: O(1) - Constant space, as it creates only a few variables.
+     */
+    /**
+     * Time Complexity: O(1) - Constant time for Map operations.
+     * Space Complexity: O(1) - Constant space, as it creates only a few variables.
+     *
      * The `deleteVertex` function removes a vertex from a graph by its ID or by the vertex object itself.
      * @param {VO | VertexKey} vertexOrKey - The parameter `vertexOrKey` can be either a vertex object (`VO`) or a vertex ID
      * (`VertexKey`).
@@ -79,6 +100,13 @@ export declare abstract class AbstractGraph<V = any, E = any, VO extends Abstrac
      */
     deleteVertex(vertexOrKey: VO | VertexKey): boolean;
     /**
+     * Time Complexity: O(K), where K is the number of vertices to be removed.
+     * Space Complexity: O(1) - Constant space, as it creates only a few variables.
+     */
+    /**
+     * Time Complexity: O(K), where K is the number of vertices to be removed.
+     * Space Complexity: O(1) - Constant space, as it creates only a few variables.
+     *
      * The function removes all vertices from a graph and returns a boolean indicating if any vertices were removed.
      * @param {VO[] | VertexKey[]} vertices - The `vertices` parameter can be either an array of vertices (`VO[]`) or an array
      * of vertex IDs (`VertexKey[]`).
@@ -87,6 +115,13 @@ export declare abstract class AbstractGraph<V = any, E = any, VO extends Abstrac
      */
     removeManyVertices(vertices: VO[] | VertexKey[]): boolean;
     /**
+     * Time Complexity: O(1) - Depends on the implementation in the concrete class.
+     * Space Complexity: O(1) - Depends on the implementation in the concrete class.
+     */
+    /**
+     * Time Complexity: O(1) - Depends on the implementation in the concrete class.
+     * Space Complexity: O(1) - Depends on the implementation in the concrete class.
+     *
      * The function checks if there is an edge between two vertices and returns a boolean value indicating the result.
      * @param {VertexKey | VO} v1 - The parameter v1 can be either a VertexKey or a VO. A VertexKey represents the unique
      * identifier of a vertex in a graph, while VO represents the type of the vertex object itself.
@@ -98,6 +133,13 @@ export declare abstract class AbstractGraph<V = any, E = any, VO extends Abstrac
     addEdge(edge: EO): boolean;
     addEdge(src: VO | VertexKey, dest: VO | VertexKey, weight?: number, value?: E): boolean;
     /**
+     * Time Complexity: O(1) - Constant time for Map and Edge operations.
+     * Space Complexity: O(1) - Constant space, as it creates only a few variables.
+     */
+    /**
+     * Time Complexity: O(1) - Constant time for Map and Edge operations.
+     * Space Complexity: O(1) - Constant space, as it creates only a few variables.
+     *
      * The function sets the weight of an edge between two vertices in a graph.
      * @param {VertexKey | VO} srcOrKey - The `srcOrKey` parameter can be either a `VertexKey` or a `VO` object. It represents
      * the source vertex of the edge.
@@ -110,6 +152,13 @@ export declare abstract class AbstractGraph<V = any, E = any, VO extends Abstrac
      */
     setEdgeWeight(srcOrKey: VertexKey | VO, destOrKey: VertexKey | VO, weight: number): boolean;
     /**
+     * Time Complexity: O(P), where P is the number of paths found (in the worst case, exploring all paths).
+     * Space Complexity: O(P) - Linear space, where P is the number of paths found.
+     */
+    /**
+     * Time Complexity: O(P), where P is the number of paths found (in the worst case, exploring all paths).
+     * Space Complexity: O(P) - Linear space, where P is the number of paths found.
+     *
      * The function `getAllPathsBetween` finds all paths between two vertices in a graph using depth-first search.
      * @param {VO | VertexKey} v1 - The parameter `v1` represents either a vertex object (`VO`) or a vertex ID (`VertexKey`).
      * It is the starting vertex for finding paths.
@@ -119,12 +168,26 @@ export declare abstract class AbstractGraph<V = any, E = any, VO extends Abstrac
      */
     getAllPathsBetween(v1: VO | VertexKey, v2: VO | VertexKey, limit?: number): VO[][];
     /**
+     * Time Complexity: O(L), where L is the length of the path.
+     * Space Complexity: O(1) - Constant space.
+     */
+    /**
+     * Time Complexity: O(L), where L is the length of the path.
+     * Space Complexity: O(1) - Constant space.
+     *
      * The function calculates the sum of weights along a given path.
      * @param {VO[]} path - An array of vertices (VO) representing a path in a graph.
      * @returns The function `getPathSumWeight` returns the sum of the weights of the edges in the given path.
      */
     getPathSumWeight(path: VO[]): number;
     /**
+     * Time Complexity: O(V + E) - Depends on the implementation (Dijkstra's algorithm).
+     * Space Complexity: O(V + E) - Depends on the implementation (Dijkstra's algorithm).
+     */
+    /**
+     * Time Complexity: O(V + E) - Depends on the implementation (Dijkstra's algorithm).
+     * Space Complexity: O(V + E) - Depends on the implementation (Dijkstra's algorithm).
+     *
      * The function `getMinCostBetween` calculates the minimum cost between two vertices in a graph, either based on edge
      * weights or using a breadth-first search algorithm.
      * @param {VO | VertexKey} v1 - The parameter `v1` represents the starting vertex or its ID.
@@ -140,6 +203,13 @@ export declare abstract class AbstractGraph<V = any, E = any, VO extends Abstrac
      */
     getMinCostBetween(v1: VO | VertexKey, v2: VO | VertexKey, isWeight?: boolean): number | null;
     /**
+     * Time Complexity: O(V + E) - Depends on the implementation (Dijkstra's algorithm or DFS).
+     * Space Complexity: O(V + E) - Depends on the implementation (Dijkstra's algorithm or DFS).
+     */
+    /**
+     * Time Complexity: O(V + E) - Depends on the implementation (Dijkstra's algorithm or DFS).
+     * Space Complexity: O(V + E) - Depends on the implementation (Dijkstra's algorithm or DFS).
+     *
      * The function `getMinPathBetween` returns the minimum path between two vertices in a graph, either based on weight or
      * using a breadth-first search algorithm.
      * @param {VO | VertexKey} v1 - The parameter `v1` represents the starting vertex of the path. It can be either a vertex
@@ -157,29 +227,35 @@ export declare abstract class AbstractGraph<V = any, E = any, VO extends Abstrac
      */
     getMinPathBetween(v1: VO | VertexKey, v2: VO | VertexKey, isWeight?: boolean, isDFS?: boolean): VO[] | null;
     /**
-     * Dijkstra algorithm time: O(VE) space: O(VO + EO)
+     *  Dijkstra algorithm time: O(VE) space: O(VO + EO)
      * /
   
      /**
-     * Dijkstra algorithm time: O(VE) space: O(VO + EO)
-     * The function `dijkstraWithoutHeap` implements Dijkstra's algorithm to find the shortest path between two vertices in
-     * a graph without using a heap data structure.
-     * @param {VO | VertexKey} src - The source vertex from which to start the Dijkstra's algorithm. It can be either a
-     * vertex object or a vertex ID.
-     * @param {VO | VertexKey | null} [dest] - The `dest` parameter in the `dijkstraWithoutHeap` function is an optional
-     * parameter that specifies the destination vertex for the Dijkstra algorithm. It can be either a vertex object or its
-     * identifier. If no destination is provided, the value is set to `null`.
-     * @param {boolean} [getMinDist] - The `getMinDist` parameter is a boolean flag that determines whether the minimum
-     * distance from the source vertex to the destination vertex should be calculated and returned in the result. If
-     * `getMinDist` is set to `true`, the `minDist` property in the result will contain the minimum distance
-     * @param {boolean} [genPaths] - The `genPaths` parameter is a boolean flag that determines whether or not to generate
-     * paths in the Dijkstra algorithm. If `genPaths` is set to `true`, the algorithm will calculate and return the
-     * shortest paths from the source vertex to all other vertices in the graph. If `genPaths
-     * @returns The function `dijkstraWithoutHeap` returns an object of type `DijkstraResult<VO>`.
+     * Time Complexity: O(V^2 + E) - Quadratic time in the worst case (no heap optimization).
+     * Space Complexity: O(V + E) - Depends on the implementation (Dijkstra's algorithm).
      */
+    /**
+    * Time Complexity: O(V^2 + E) - Quadratic time in the worst case (no heap optimization).
+    * Space Complexity: O(V + E) - Depends on the implementation (Dijkstra's algorithm).
+    *
+    * The function `dijkstraWithoutHeap` implements Dijkstra's algorithm to find the shortest path between two vertices in
+    * a graph without using a heap data structure.
+    * @param {VO | VertexKey} src - The source vertex from which to start the Dijkstra's algorithm. It can be either a
+    * vertex object or a vertex ID.
+    * @param {VO | VertexKey | null} [dest] - The `dest` parameter in the `dijkstraWithoutHeap` function is an optional
+    * parameter that specifies the destination vertex for the Dijkstra algorithm. It can be either a vertex object or its
+    * identifier. If no destination is provided, the value is set to `null`.
+    * @param {boolean} [getMinDist] - The `getMinDist` parameter is a boolean flag that determines whether the minimum
+    * distance from the source vertex to the destination vertex should be calculated and returned in the result. If
+    * `getMinDist` is set to `true`, the `minDist` property in the result will contain the minimum distance
+    * @param {boolean} [genPaths] - The `genPaths` parameter is a boolean flag that determines whether or not to generate
+    * paths in the Dijkstra algorithm. If `genPaths` is set to `true`, the algorithm will calculate and return the
+    * shortest paths from the source vertex to all other vertices in the graph. If `genPaths
+    * @returns The function `dijkstraWithoutHeap` returns an object of type `DijkstraResult<VO>`.
+    */
     dijkstraWithoutHeap(src: VO | VertexKey, dest?: VO | VertexKey | null, getMinDist?: boolean, genPaths?: boolean): DijkstraResult<VO>;
     /**
-     * Dijkstra algorithm time: O(logVE) space: O(VO + EO)
+     *  Dijkstra algorithm time: O(logVE) space: O(VO + EO)
      *
      * Dijkstra's algorithm only solves the single-source shortest path problem, while the Bellman-Ford algorithm and Floyd-Warshall algorithm can address shortest paths between all pairs of nodes.
      * Dijkstra's algorithm is suitable for graphs with non-negative edge weights, whereas the Bellman-Ford algorithm and Floyd-Warshall algorithm can handle negative-weight edges.
@@ -188,30 +264,40 @@ export declare abstract class AbstractGraph<V = any, E = any, VO extends Abstrac
      * /
   
      /**
-     * Dijkstra's algorithm is used to find the shortest paths from a source node to all other nodes in a graph. Its basic idea is to repeatedly choose the node closest to the source node and update the distances of other nodes using this node as an intermediary. Dijkstra's algorithm requires that the edge weights in the graph are non-negative.
-     * The `dijkstra` function implements Dijkstra's algorithm to find the shortest path between a source vertex and an
-     * optional destination vertex, and optionally returns the minimum distance, the paths, and other information.
-     * @param {VO | VertexKey} src - The `src` parameter represents the source vertex from which the Dijkstra algorithm will
-     * start. It can be either a vertex object or a vertex ID.
-     * @param {VO | VertexKey | null} [dest] - The `dest` parameter is the destination vertex or vertex ID. It specifies the
-     * vertex to which the shortest path is calculated from the source vertex. If no destination is provided, the algorithm
-     * will calculate the shortest paths to all other vertices from the source vertex.
-     * @param {boolean} [getMinDist] - The `getMinDist` parameter is a boolean flag that determines whether the minimum
-     * distance from the source vertex to the destination vertex should be calculated and returned in the result. If
-     * `getMinDist` is set to `true`, the `minDist` property in the result will contain the minimum distance
-     * @param {boolean} [genPaths] - The `genPaths` parameter is a boolean flag that determines whether or not to generate
-     * paths in the Dijkstra algorithm. If `genPaths` is set to `true`, the algorithm will calculate and return the
-     * shortest paths from the source vertex to all other vertices in the graph. If `genPaths
-     * @returns The function `dijkstra` returns an object of type `DijkstraResult<VO>`.
+     * Time Complexity: O((V + E) * log(V)) - Depends on the implementation (using a binary heap).
+     * Space Complexity: O(V + E) - Depends on the implementation (using a binary heap).
      */
+    /**
+    * Time Complexity: O((V + E) * log(V)) - Depends on the implementation (using a binary heap).
+    * Space Complexity: O(V + E) - Depends on the implementation (using a binary heap).
+    *
+    * Dijkstra's algorithm is used to find the shortest paths from a source node to all other nodes in a graph. Its basic idea is to repeatedly choose the node closest to the source node and update the distances of other nodes using this node as an intermediary. Dijkstra's algorithm requires that the edge weights in the graph are non-negative.
+    * The `dijkstra` function implements Dijkstra's algorithm to find the shortest path between a source vertex and an
+    * optional destination vertex, and optionally returns the minimum distance, the paths, and other information.
+    * @param {VO | VertexKey} src - The `src` parameter represents the source vertex from which the Dijkstra algorithm will
+    * start. It can be either a vertex object or a vertex ID.
+    * @param {VO | VertexKey | null} [dest] - The `dest` parameter is the destination vertex or vertex ID. It specifies the
+    * vertex to which the shortest path is calculated from the source vertex. If no destination is provided, the algorithm
+    * will calculate the shortest paths to all other vertices from the source vertex.
+    * @param {boolean} [getMinDist] - The `getMinDist` parameter is a boolean flag that determines whether the minimum
+    * distance from the source vertex to the destination vertex should be calculated and returned in the result. If
+    * `getMinDist` is set to `true`, the `minDist` property in the result will contain the minimum distance
+    * @param {boolean} [genPaths] - The `genPaths` parameter is a boolean flag that determines whether or not to generate
+    * paths in the Dijkstra algorithm. If `genPaths` is set to `true`, the algorithm will calculate and return the
+    * shortest paths from the source vertex to all other vertices in the graph. If `genPaths
+    * @returns The function `dijkstra` returns an object of type `DijkstraResult<VO>`.
+    */
     dijkstra(src: VO | VertexKey, dest?: VO | VertexKey | null, getMinDist?: boolean, genPaths?: boolean): DijkstraResult<VO>;
     /**
-     * BellmanFord time:O(VE) space:O(VO)
+     * Time Complexity: O(V * E) - Quadratic time in the worst case (Bellman-Ford algorithm).
+     * Space Complexity: O(V + E) - Depends on the implementation (Bellman-Ford algorithm).
      * one to rest pairs
      * /
   
      /**
-     * BellmanFord time:O(VE) space:O(VO)
+     * Time Complexity: O(V * E) - Quadratic time in the worst case (Bellman-Ford algorithm).
+     * Space Complexity: O(V + E) - Depends on the implementation (Bellman-Ford algorithm).
+     *
      * one to rest pairs
      * The Bellman-Ford algorithm is also used to find the shortest paths from a source node to all other nodes in a graph. Unlike Dijkstra's algorithm, it can handle edge weights that are negative. Its basic idea involves iterative relaxation of all edges for several rounds to gradually approximate the shortest paths. Due to its ability to handle negative-weight edges, the Bellman-Ford algorithm is more flexible in some scenarios.
      * The `bellmanFord` function implements the Bellman-Ford algorithm to find the shortest path from a source vertex to
@@ -249,13 +335,18 @@ export declare abstract class AbstractGraph<V = any, E = any, VO extends Abstrac
      * The `bellmanFord` function implements the Bellman-Ford algorithm to find the shortest path from a source vertex to
      */
     /**
-     * Floyd algorithm time: O(VO^3) space: O(VO^2), not support graph with negative weight cycle
+     * Time Complexity: O(V^3) - Cubic time (Floyd-Warshall algorithm).
+     * Space Complexity: O(V^2) - Quadratic space (Floyd-Warshall algorithm).
+     * Not support graph with negative weight cycle
      * all pairs
      * The Floyd-Warshall algorithm is used to find the shortest paths between all pairs of nodes in a graph. It employs dynamic programming to compute the shortest paths from any node to any other node. The Floyd-Warshall algorithm's advantage lies in its ability to handle graphs with negative-weight edges, and it can simultaneously compute shortest paths between any two nodes.
      * /
   
      /**
-     * Floyd algorithm time: O(VO^3) space: O(VO^2), not support graph with negative weight cycle
+     * Time Complexity: O(V^3) - Cubic time (Floyd-Warshall algorithm).
+     * Space Complexity: O(V^2) - Quadratic space (Floyd-Warshall algorithm).
+     *
+     * Not support graph with negative weight cycle
      * all pairs
      * The Floyd-Warshall algorithm is used to find the shortest paths between all pairs of nodes in a graph. It employs dynamic programming to compute the shortest paths from any node to any other node. The Floyd-Warshall algorithm's advantage lies in its ability to handle graphs with negative-weight edges, and it can simultaneously compute shortest paths between any two nodes.
      * The function implements the Floyd-Warshall algorithm to find the shortest path between all pairs of vertices in a
@@ -270,6 +361,8 @@ export declare abstract class AbstractGraph<V = any, E = any, VO extends Abstrac
         predecessor: (VO | null)[][];
     };
     /**
+     * Time Complexity: O(V + E) - Linear time (Tarjan's algorithm).
+     * Space Complexity: O(V) - Linear space (Tarjan's algorithm).
      * Tarjan is an algorithm based on dfs,which is used to solve the connectivity problem of graphs.
      * Tarjan can find cycles in directed or undirected graph
      * Tarjan can find the articulation points and bridges(critical edges) of undirected graphs in linear time,
@@ -278,6 +371,9 @@ export declare abstract class AbstractGraph<V = any, E = any, VO extends Abstrac
      * /
   
      /**
+     * Time Complexity: O(V + E) - Linear time (Tarjan's algorithm).
+     * Space Complexity: O(V) - Linear space (Tarjan's algorithm).
+     *
      * Tarjan is an algorithm based on dfs,which is used to solve the connectivity problem of graphs.
      * Tarjan can find cycles in directed or undirected graph
      * Tarjan can find the articulation points and bridges(critical edges) of undirected graphs in linear time,
@@ -307,6 +403,13 @@ export declare abstract class AbstractGraph<V = any, E = any, VO extends Abstrac
         cycles: Map<number, VO[]>;
     };
     /**
+     * Time Complexity: O(V + E) - Depends on the implementation (Tarjan's algorithm).
+     * Space Complexity: O(V) - Depends on the implementation (Tarjan's algorithm).
+     */
+    /**
+     * Time Complexity: O(V + E) - Depends on the implementation (Tarjan's algorithm).
+     * Space Complexity: O(V) - Depends on the implementation (Tarjan's algorithm).
+     *
      * The function returns a map that associates each vertex object with its corresponding depth-first
      * number.
      * @returns A Map object with keys of type VO and values of type number.