min-heap-typed 1.42.8 → 1.42.9

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

@@ -53,6 +53,13 @@ class AbstractGraph {
         return this._vertices;
     }
     /**
+     * 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 @@ class AbstractGraph {
         return this._vertices.get(vertexKey) || 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`).
@@ -71,6 +85,10 @@ class AbstractGraph {
     hasVertex(vertexOrKey) {
         return this._vertices.has(this._getVertexKey(vertexOrKey));
     }
+    /**
+     * Time Complexity: O(1) - Constant time for Map operations.
+     * Space Complexity: O(1) - Constant space, as it creates only a few variables.
+     */
     addVertex(keyOrVertex, value) {
         if (keyOrVertex instanceof AbstractVertex) {
             return this._addVertexOnly(keyOrVertex);
@@ -81,6 +99,13 @@ class AbstractGraph {
         }
     }
     /**
+     * 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`).
@@ -91,6 +116,13 @@ class AbstractGraph {
         return this._vertices.delete(vertexKey);
     }
     /**
+     * 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[]`).
@@ -105,6 +137,13 @@ class AbstractGraph {
         return removed.length > 0;
     }
     /**
+     * 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.
@@ -116,6 +155,10 @@ class AbstractGraph {
         const edge = this.getEdge(v1, v2);
         return !!edge;
     }
+    /**
+     * Time Complexity: O(1) - Depends on the implementation in the concrete class.
+     * Space Complexity: O(1) - Depends on the implementation in the concrete class.
+     */
     addEdge(srcOrEdge, dest, weight, value) {
         if (srcOrEdge instanceof AbstractEdge) {
             return this._addEdgeOnly(srcOrEdge);
@@ -137,6 +180,13 @@ class AbstractGraph {
         }
     }
     /**
+     * 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.
@@ -158,6 +208,13 @@ class AbstractGraph {
         }
     }
     /**
+     * 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.
@@ -192,6 +249,13 @@ class AbstractGraph {
         return paths;
     }
     /**
+     * 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.
@@ -205,6 +269,13 @@ class AbstractGraph {
         return sum;
     }
     /**
+     * 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.
@@ -263,6 +334,13 @@ class AbstractGraph {
         }
     }
     /**
+     * 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
@@ -330,26 +408,32 @@ class AbstractGraph {
         }
     }
     /**
-     * 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, dest, getMinDist, genPaths) {
         if (getMinDist === undefined)
             getMinDist = false;
@@ -453,7 +537,7 @@ class AbstractGraph {
         return { distMap, preMap, seen, paths, minDist, minPath };
     }
     /**
-     * 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.
@@ -462,22 +546,29 @@ class AbstractGraph {
      * /
   
      /**
-     * 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, dest, getMinDist, genPaths) {
         var _a;
         if (getMinDist === undefined)
@@ -581,12 +672,15 @@ class AbstractGraph {
         return { distMap, preMap, seen, paths, minDist, minPath };
     }
     /**
-     * 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
@@ -701,13 +795,18 @@ class AbstractGraph {
      * 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
@@ -749,6 +848,8 @@ class AbstractGraph {
         return { costs, predecessor };
     }
     /**
+     * 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,
@@ -757,6 +858,9 @@ class AbstractGraph {
      * /
   
      /**
+     * 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,
@@ -872,6 +976,13 @@ class AbstractGraph {
         return { dfnMap, lowMap, bridges, cutVertexes, SCCs, cycles };
     }
     /**
+     * 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.

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

@@ -66,6 +66,13 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
      */
     createEdge(src: VertexKey, dest: VertexKey, weight?: number, value?: E): EO;
     /**
+     * Time Complexity: O(|V|) where |V| is the number of vertices
+     * Space Complexity: O(1)
+     */
+    /**
+     * Time Complexity: O(|V|) where |V| is the number of vertices
+     * Space Complexity: O(1)
+     *
      * The `getEdge` function retrieves an edge between two vertices based on their source and destination IDs.
      * @param {VO | VertexKey | null} srcOrKey - The source vertex or its ID. It can be either a vertex object or a vertex ID.
      * @param {VO | VertexKey | null} destOrKey - The `destOrKey` parameter in the `getEdge` function represents the
@@ -75,6 +82,13 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
      */
     getEdge(srcOrKey: VO | VertexKey | null, destOrKey: VO | VertexKey | null): EO | null;
     /**
+     * Time Complexity: O(|E|) where |E| is the number of edges
+     * Space Complexity: O(1)
+     */
+    /**
+     * Time Complexity: O(|E|) where |E| is the number of edges
+     * Space Complexity: O(1)
+     *
      * The function removes an edge between two vertices in a graph and returns the removed edge.
      * @param {VO | VertexKey} srcOrKey - The source vertex or its ID.
      * @param {VO | VertexKey} destOrKey - The `destOrKey` parameter represents the destination vertex or its ID.
@@ -82,6 +96,13 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
      */
     deleteEdgeSrcToDest(srcOrKey: VO | VertexKey, destOrKey: VO | VertexKey): EO | null;
     /**
+     * Time Complexity: O(|E|) where |E| is the number of edges
+     * Space Complexity: O(1)
+     */
+    /**
+     * Time Complexity: O(|E|) where |E| is the number of edges
+     * Space Complexity: O(1)
+     *
      * The function removes an edge from a graph and returns the removed edge, or null if the edge was not found.
      * @param {EO} edge - The `edge` parameter is an object that represents an edge in a graph. It has two properties: `src`
      * and `dest`, which represent the source and destination vertices of the edge, respectively.
@@ -89,6 +110,13 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
      */
     deleteEdge(edge: EO): EO | null;
     /**
+     * Time Complexity: O(|E|) where |E| is the number of edges
+     * Space Complexity: O(1)
+     */
+    /**
+     * Time Complexity: O(|E|) where |E| is the number of edges
+     * Space Complexity: O(1)
+     *
      * The function removes edges between two vertices and returns the removed edges.
      * @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 actual vertex object.
@@ -98,6 +126,13 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
      */
     deleteEdgesBetween(v1: VertexKey | VO, v2: VertexKey | VO): EO[];
     /**
+     * Time Complexity: O(1)
+     * Space Complexity: O(1)
+     */
+    /**
+     * Time Complexity: O(1)
+     * Space Complexity: O(1)
+     *
      * The function `incomingEdgesOf` returns an array of incoming edges for a given vertex or vertex ID.
      * @param {VO | VertexKey} vertexOrKey - The parameter `vertexOrKey` can be either a vertex object (`VO`) or a vertex ID
      * (`VertexKey`).
@@ -105,6 +140,13 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
      */
     incomingEdgesOf(vertexOrKey: VO | VertexKey): EO[];
     /**
+     * Time Complexity: O(1)
+     * Space Complexity: O(1)
+     */
+    /**
+     * Time Complexity: O(1)
+     * Space Complexity: O(1)
+     *
      * The function `outgoingEdgesOf` returns an array of outgoing edges from a given vertex or vertex ID.
      * @param {VO | VertexKey} vertexOrKey - The parameter `vertexOrKey` can accept either a vertex object (`VO`) or a vertex ID
      * (`VertexKey`).
@@ -112,42 +154,91 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
      */
     outgoingEdgesOf(vertexOrKey: VO | VertexKey): EO[];
     /**
+     * Time Complexity: O(1)
+     * Space Complexity: O(1)
+     */
+    /**
+     * Time Complexity: O(1)
+     * Space Complexity: O(1)
+     *
      * The function "degreeOf" returns the total degree of a vertex, which is the sum of its out-degree and in-degree.
      * @param {VertexKey | VO} vertexOrKey - The parameter `vertexOrKey` can be either a `VertexKey` or a `VO`.
      * @returns The sum of the out-degree and in-degree of the specified vertex or vertex ID.
      */
     degreeOf(vertexOrKey: VertexKey | VO): number;
     /**
+     * Time Complexity: O(1)
+     * Space Complexity: O(1)
+     */
+    /**
+     * Time Complexity: O(1)
+     * Space Complexity: O(1)
+     *
      * The function "inDegreeOf" returns the number of incoming edges for a given vertex.
      * @param {VertexKey | VO} vertexOrKey - The parameter `vertexOrKey` can be either a `VertexKey` or a `VO`.
      * @returns The number of incoming edges of the specified vertex or vertex ID.
      */
     inDegreeOf(vertexOrKey: VertexKey | VO): number;
     /**
+     * Time Complexity: O(1)
+     * Space Complexity: O(1)
+     */
+    /**
+     * Time Complexity: O(1)
+     * Space Complexity: O(1)
+     *
      * The function `outDegreeOf` returns the number of outgoing edges from a given vertex.
      * @param {VertexKey | VO} vertexOrKey - The parameter `vertexOrKey` can be either a `VertexKey` or a `VO`.
      * @returns The number of outgoing edges from the specified vertex or vertex ID.
      */
     outDegreeOf(vertexOrKey: VertexKey | VO): number;
     /**
+     * Time Complexity: O(1)
+     * Space Complexity: O(1)
+     */
+    /**
+     * Time Complexity: O(1)
+     * Space Complexity: O(1)
+     *
      * The function "edgesOf" returns an array of both outgoing and incoming edges of a given vertex or vertex ID.
      * @param {VertexKey | VO} vertexOrKey - The parameter `vertexOrKey` can be either a `VertexKey` or a `VO`.
      * @returns The function `edgesOf` returns an array of edges.
      */
     edgesOf(vertexOrKey: VertexKey | VO): EO[];
     /**
+     * Time Complexity: O(1)
+     * Space Complexity: O(1)
+     */
+    /**
+     * Time Complexity: O(1)
+     * Space Complexity: O(1)
+     *
      * The function "getEdgeSrc" returns the source vertex of an edge, or null if the edge does not exist.
      * @param {EO} e - The parameter "e" is of type EO, which represents an edge in a graph.
      * @returns either a vertex object (VO) or null.
      */
     getEdgeSrc(e: EO): VO | null;
     /**
+     * Time Complexity: O(1)
+     * Space Complexity: O(1)
+     */
+    /**
+     * Time Complexity: O(1)
+     * Space Complexity: O(1)
+     *
      * The function "getEdgeDest" returns the destination vertex of an edge.
      * @param {EO} e - The parameter "e" is of type "EO", which represents an edge in a graph.
      * @returns either a vertex object of type VO or null.
      */
     getEdgeDest(e: EO): VO | null;
     /**
+     * Time Complexity: O(|E|) where |E| is the number of edges
+     * Space Complexity: O(1)
+     */
+    /**
+     * Time Complexity: O(|E|) where |E| is the number of edges
+     * Space Complexity: O(1)
+     *
      * The function `getDestinations` returns an array of destination vertices connected to a given vertex.
      * @param {VO | VertexKey | null} vertex - The `vertex` parameter represents the starting vertex from which we want to
      * find the destinations. It can be either a `VO` object, a `VertexKey` value, or `null`.
@@ -155,6 +246,13 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
      */
     getDestinations(vertex: VO | VertexKey | null): VO[];
     /**
+     * Time Complexity: O(|V| + |E|) where |V| is the number of vertices and |E| is the number of edges
+     * Space Complexity: O(|V|)
+     */
+    /**
+     * Time Complexity: O(|V| + |E|) where |V| is the number of vertices and |E| is the number of edges
+     * Space Complexity: O(|V|)
+     *
      * The `topologicalSort` function performs a topological sort on a graph and returns an array of vertices or vertex IDs
      * in the sorted order, or null if the graph contains a cycle.
      * @param {'vertex' | 'key'} [propertyName] - The `propertyName` parameter is an optional parameter that specifies the
@@ -164,11 +262,25 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
      */
     topologicalSort(propertyName?: 'vertex' | 'key'): Array<VO | VertexKey> | null;
     /**
+     * Time Complexity: O(|E|) where |E| is the number of edges
+     * Space Complexity: O(|E|)
+     */
+    /**
+     * Time Complexity: O(|E|) where |E| is the number of edges
+     * Space Complexity: O(|E|)
+     *
      * The `edgeSet` function returns an array of all the edges in the graph.
      * @returns The `edgeSet()` method returns an array of edges (`EO[]`).
      */
     edgeSet(): EO[];
     /**
+     * Time Complexity: O(|E|) where |E| is the number of edges
+     * Space Complexity: O(1)
+     */
+    /**
+     * Time Complexity: O(|E|) where |E| is the number of edges
+     * Space Complexity: O(1)
+     *
      * The function `getNeighbors` returns an array of neighboring vertices of a given vertex or vertex ID in a graph.
      * @param {VO | VertexKey} vertexOrKey - The parameter `vertexOrKey` can be either a vertex object (`VO`) or a vertex ID
      * (`VertexKey`).
@@ -176,6 +288,13 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
      */
     getNeighbors(vertexOrKey: VO | VertexKey): VO[];
     /**
+     * Time Complexity: O(1)
+     * Space Complexity: O(1)
+     */
+    /**
+     * Time Complexity: O(1)
+     * Space Complexity: O(1)
+     *
      * The function "getEndsOfEdge" returns the source and destination vertices of an edge if it exists in the graph,
      * otherwise it returns null.
      * @param {EO} edge - The parameter `edge` is of type `EO`, which represents an edge in a graph.
@@ -184,6 +303,13 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
      */
     getEndsOfEdge(edge: EO): [VO, VO] | null;
     /**
+     * Time Complexity: O(1)
+     * Space Complexity: O(1)
+     */
+    /**
+     * Time Complexity: O(1)
+     * Space Complexity: O(1)
+     *
      * The function `_addEdgeOnly` adds an edge to a graph if the source and destination vertices exist.
      * @param {EO} edge - The parameter `edge` is of type `EO`, which represents an edge in a graph. It is the edge that
      * needs to be added to the graph.