data-structure-typed 1.43.1 → 1.43.3

package/dist/mjs/src/data-structures/graph/abstract-graph.js

@@ -417,24 +417,24 @@ class AbstractGraph {
      * 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>`.
-    */
+     * 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, dest, getMinDist, genPaths) {
         if (getMinDist === undefined)
             getMinDist = false;
@@ -551,25 +551,25 @@ class AbstractGraph {
      * 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>`.
-    */
+     * 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, dest, getMinDist, genPaths) {
         if (getMinDist === undefined)
             getMinDist = false;

package/dist/mjs/src/interfaces/binary-tree.d.ts

@@ -1,5 +1,5 @@
 import { BinaryTreeNode } from '../data-structures';
-import { BiTreeDeleteResult, BinaryTreeNodeNested, BTNCallback, BTNKey } from '../types';
+import { BinaryTreeNodeNested, BiTreeDeleteResult, BTNCallback, BTNKey } from '../types';
 export interface IBinaryTree<V = any, N extends BinaryTreeNode<V, N> = BinaryTreeNodeNested<V>> {
     createNode(key: BTNKey, value?: N['value']): N;
     add(keyOrNode: BTNKey | N | null, value?: N['value']): N | null | undefined;