doubly-linked-list-typed 1.52.4 → 1.52.6

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

@@ -45,10 +45,6 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
     protected _inEdgeMap: Map<VO, EO[]>;
     get inEdgeMap(): Map<VO, EO[]>;
     set inEdgeMap(v: Map<VO, EO[]>);
-    /**
-     * In TypeScript, a subclass inherits the interface implementation of its parent class, without needing to implement the same interface again in the subclass. This behavior differs from Java's approach. In Java, if a parent class implements an interface, the subclass needs to explicitly implement the same interface, even if the parent class has already implemented it.
-     * This means that using abstract methods in the parent class cannot constrain the grandchild classes. Defining methods within an interface also cannot constrain the descendant classes. When inheriting from this class, developers need to be aware that this method needs to be overridden.
-     */
     /**
      * The function creates a new vertex with an optional value and returns it.
      * @param {VertexKey} key - The `key` parameter is the unique identifier for the vertex. It is of type `VertexKey`, which
@@ -59,10 +55,6 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
      * @returns a new instance of a DirectedVertex object, casted as type VO.
      */
     createVertex(key: VertexKey, value?: V): VO;
-    /**
-     * In TypeScript, a subclass inherits the interface implementation of its parent class, without needing to implement the same interface again in the subclass. This behavior differs from Java's approach. In Java, if a parent class implements an interface, the subclass needs to explicitly implement the same interface, even if the parent class has already implemented it.
-     * This means that using abstract methods in the parent class cannot constrain the grandchild classes. Defining methods within an interface also cannot constrain the descendant classes. When inheriting from this class, developers need to be aware that this method needs to be overridden.
-     */
     /**
      * The function creates a directed edge between two vertexMap with an optional weight and value.
      * @param {VertexKey} src - The source vertex ID of the edge. It represents the starting point of the edge.
@@ -74,10 +66,6 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
      * @returns a new instance of a DirectedEdge object, casted as type EO.
      */
     createEdge(src: VertexKey, dest: VertexKey, weight?: number, value?: E): EO;
-    /**
-     * Time Complexity: O(|V|) where |V| is the number of vertexMap
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(|V|) where |V| is the number of vertexMap
      * Space Complexity: O(1)
@@ -90,10 +78,6 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
      * @returns the first edge found between the source and destination vertexMap, or undefined if no such edge is found.
      */
     getEdge(srcOrKey: VO | VertexKey | undefined, destOrKey: VO | VertexKey | undefined): EO | undefined;
-    /**
-     * Time Complexity: O(|E|) where |E| is the number of edgeMap
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(|E|) where |E| is the number of edgeMap
      * Space Complexity: O(1)
@@ -104,10 +88,6 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
      * @returns the removed edge (EO) if it exists, or undefined if either the source or destination vertex does not exist.
      */
     deleteEdgeSrcToDest(srcOrKey: VO | VertexKey, destOrKey: VO | VertexKey): EO | undefined;
-    /**
-     * Time Complexity: O(E) where E is the number of edgeMap
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(E) where E is the number of edgeMap
      * Space Complexity: O(1)
@@ -122,10 +102,6 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
      * @returns the removed edge (EO) or undefined if no edge was removed.
      */
     deleteEdge(edgeOrSrcVertexKey: EO | VertexKey, destVertexKey?: VertexKey): EO | undefined;
-    /**
-     * 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.
@@ -136,10 +112,6 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
      * @returns The method is returning a boolean value.
      */
     deleteVertex(vertexOrKey: VO | VertexKey): boolean;
-    /**
-     * Time Complexity: O(|E|) where |E| is the number of edgeMap
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(|E|) where |E| is the number of edgeMap
      * Space Complexity: O(1)
@@ -152,10 +124,6 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
      * @returns an array of removed edgeMap (EO[]).
      */
     deleteEdgesBetween(v1: VertexKey | VO, v2: VertexKey | VO): EO[];
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -166,10 +134,6 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
      * @returns The method `incomingEdgesOf` returns an array of edgeMap (`EO[]`).
      */
     incomingEdgesOf(vertexOrKey: VO | VertexKey): EO[];
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -180,10 +144,6 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
      * @returns The method `outgoingEdgesOf` returns an array of edgeMap (`EO[]`).
      */
     outgoingEdgesOf(vertexOrKey: VO | VertexKey): EO[];
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -193,10 +153,6 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
      * @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)
@@ -206,10 +162,6 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
      * @returns The number of incoming edgeMap 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)
@@ -219,10 +171,6 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
      * @returns The number of outgoing edgeMap 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)
@@ -232,10 +180,6 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
      * @returns The function `edgesOf` returns an array of edgeMap.
      */
     edgesOf(vertexOrKey: VertexKey | VO): EO[];
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -245,10 +189,6 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
      * @returns either a vertex object (VO) or undefined.
      */
     getEdgeSrc(e: EO): VO | undefined;
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -258,10 +198,6 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
      * @returns either a vertex object of type VO or undefined.
      */
     getEdgeDest(e: EO): VO | undefined;
-    /**
-     * Time Complexity: O(|E|) where |E| is the number of edgeMap
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(|E|) where |E| is the number of edgeMap
      * Space Complexity: O(1)
@@ -272,10 +208,6 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
      * @returns an array of vertexMap (VO[]).
      */
     getDestinations(vertex: VO | VertexKey | undefined): VO[];
-    /**
-     * Time Complexity: O(|V| + |E|) where |V| is the number of vertexMap and |E| is the number of edgeMap
-     * Space Complexity: O(|V|)
-     */
     /**
      * Time Complexity: O(|V| + |E|) where |V| is the number of vertexMap and |E| is the number of edgeMap
      * Space Complexity: O(|V|)
@@ -288,10 +220,6 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
      * @returns an array of vertexMap or vertex IDs in topological order. If there is a cycle in the graph, it returns undefined.
      */
     topologicalSort(propertyName?: 'vertex' | 'key'): Array<VO | VertexKey> | undefined;
-    /**
-     * Time Complexity: O(|E|) where |E| is the number of edgeMap
-     * Space Complexity: O(|E|)
-     */
     /**
      * Time Complexity: O(|E|) where |E| is the number of edgeMap
      * Space Complexity: O(|E|)
@@ -300,10 +228,6 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
      * @returns The `edgeSet()` method returns an array of edgeMap (`EO[]`).
      */
     edgeSet(): EO[];
-    /**
-     * Time Complexity: O(|E|) where |E| is the number of edgeMap
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(|E|) where |E| is the number of edgeMap
      * Space Complexity: O(1)
@@ -314,10 +238,6 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
      * @returns an array of vertexMap (VO[]).
      */
     getNeighbors(vertexOrKey: VO | VertexKey): VO[];
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -335,10 +255,6 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
      * @return A boolean value
      */
     isEmpty(): boolean;
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -352,12 +268,6 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
      * @return A new instance of the directedgraph class
      */
     clone(): DirectedGraph<V, E, VO, EO>;
-    /**
-     *  Time Complexity: O(V + E)
-     *  Space Complexity: O(V)
-     *  Tarjan is an algorithm based on dfs,which is used to solve the connectivity problem of graphs.
-     *  Tarjan can find the SSC(strongly connected components), articulation points, and bridges of directed graphs.
-     */
     /**
      *  Time Complexity: O(V + E)
      *  Space Complexity: O(V)
@@ -374,10 +284,6 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
         lowMap: Map<VO, number>;
         SCCs: 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).
@@ -400,10 +306,6 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
      * @returns a map where the keys are numbers and the values are arrays of VO objects.
      */
     getSCCs(): Map<number, VO[]>;
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)

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

@@ -56,10 +56,6 @@ class DirectedGraph extends abstract_graph_1.AbstractGraph {
     set inEdgeMap(v) {
         this._inEdgeMap = v;
     }
-    /**
-     * In TypeScript, a subclass inherits the interface implementation of its parent class, without needing to implement the same interface again in the subclass. This behavior differs from Java's approach. In Java, if a parent class implements an interface, the subclass needs to explicitly implement the same interface, even if the parent class has already implemented it.
-     * This means that using abstract methods in the parent class cannot constrain the grandchild classes. Defining methods within an interface also cannot constrain the descendant classes. When inheriting from this class, developers need to be aware that this method needs to be overridden.
-     */
     /**
      * The function creates a new vertex with an optional value and returns it.
      * @param {VertexKey} key - The `key` parameter is the unique identifier for the vertex. It is of type `VertexKey`, which
@@ -72,10 +68,6 @@ class DirectedGraph extends abstract_graph_1.AbstractGraph {
     createVertex(key, value) {
         return new DirectedVertex(key, value);
     }
-    /**
-     * In TypeScript, a subclass inherits the interface implementation of its parent class, without needing to implement the same interface again in the subclass. This behavior differs from Java's approach. In Java, if a parent class implements an interface, the subclass needs to explicitly implement the same interface, even if the parent class has already implemented it.
-     * This means that using abstract methods in the parent class cannot constrain the grandchild classes. Defining methods within an interface also cannot constrain the descendant classes. When inheriting from this class, developers need to be aware that this method needs to be overridden.
-     */
     /**
      * The function creates a directed edge between two vertexMap with an optional weight and value.
      * @param {VertexKey} src - The source vertex ID of the edge. It represents the starting point of the edge.
@@ -89,10 +81,6 @@ class DirectedGraph extends abstract_graph_1.AbstractGraph {
     createEdge(src, dest, weight, value) {
         return new DirectedEdge(src, dest, weight !== null && weight !== void 0 ? weight : 1, value);
     }
-    /**
-     * Time Complexity: O(|V|) where |V| is the number of vertexMap
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(|V|) where |V| is the number of vertexMap
      * Space Complexity: O(1)
@@ -118,10 +106,6 @@ class DirectedGraph extends abstract_graph_1.AbstractGraph {
         }
         return edgeMap[0] || undefined;
     }
-    /**
-     * Time Complexity: O(|E|) where |E| is the number of edgeMap
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(|E|) where |E| is the number of edgeMap
      * Space Complexity: O(1)
@@ -148,10 +132,6 @@ class DirectedGraph extends abstract_graph_1.AbstractGraph {
         }
         return removed;
     }
-    /**
-     * Time Complexity: O(E) where E is the number of edgeMap
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(E) where E is the number of edgeMap
      * Space Complexity: O(1)
@@ -193,10 +173,6 @@ class DirectedGraph extends abstract_graph_1.AbstractGraph {
         }
         return removed;
     }
-    /**
-     * 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.
@@ -228,10 +204,6 @@ class DirectedGraph extends abstract_graph_1.AbstractGraph {
         }
         return this._vertexMap.delete(vertexKey);
     }
-    /**
-     * Time Complexity: O(|E|) where |E| is the number of edgeMap
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(|E|) where |E| is the number of edgeMap
      * Space Complexity: O(1)
@@ -253,10 +225,6 @@ class DirectedGraph extends abstract_graph_1.AbstractGraph {
         }
         return removed;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -273,10 +241,6 @@ class DirectedGraph extends abstract_graph_1.AbstractGraph {
         }
         return [];
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -293,10 +257,6 @@ class DirectedGraph extends abstract_graph_1.AbstractGraph {
         }
         return [];
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -308,10 +268,6 @@ class DirectedGraph extends abstract_graph_1.AbstractGraph {
     degreeOf(vertexOrKey) {
         return this.outDegreeOf(vertexOrKey) + this.inDegreeOf(vertexOrKey);
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -323,10 +279,6 @@ class DirectedGraph extends abstract_graph_1.AbstractGraph {
     inDegreeOf(vertexOrKey) {
         return this.incomingEdgesOf(vertexOrKey).length;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -338,10 +290,6 @@ class DirectedGraph extends abstract_graph_1.AbstractGraph {
     outDegreeOf(vertexOrKey) {
         return this.outgoingEdgesOf(vertexOrKey).length;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -353,10 +301,6 @@ class DirectedGraph extends abstract_graph_1.AbstractGraph {
     edgesOf(vertexOrKey) {
         return [...this.outgoingEdgesOf(vertexOrKey), ...this.incomingEdgesOf(vertexOrKey)];
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -368,10 +312,6 @@ class DirectedGraph extends abstract_graph_1.AbstractGraph {
     getEdgeSrc(e) {
         return this._getVertex(e.src);
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -383,10 +323,6 @@ class DirectedGraph extends abstract_graph_1.AbstractGraph {
     getEdgeDest(e) {
         return this._getVertex(e.dest);
     }
-    /**
-     * Time Complexity: O(|E|) where |E| is the number of edgeMap
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(|E|) where |E| is the number of edgeMap
      * Space Complexity: O(1)
@@ -410,10 +346,6 @@ class DirectedGraph extends abstract_graph_1.AbstractGraph {
         }
         return destinations;
     }
-    /**
-     * Time Complexity: O(|V| + |E|) where |V| is the number of vertexMap and |E| is the number of edgeMap
-     * Space Complexity: O(|V|)
-     */
     /**
      * Time Complexity: O(|V| + |E|) where |V| is the number of vertexMap and |E| is the number of edgeMap
      * Space Complexity: O(|V|)
@@ -461,10 +393,6 @@ class DirectedGraph extends abstract_graph_1.AbstractGraph {
             sorted = sorted.map(vertex => (vertex instanceof DirectedVertex ? vertex.key : vertex));
         return sorted.reverse();
     }
-    /**
-     * Time Complexity: O(|E|) where |E| is the number of edgeMap
-     * Space Complexity: O(|E|)
-     */
     /**
      * Time Complexity: O(|E|) where |E| is the number of edgeMap
      * Space Complexity: O(|E|)
@@ -479,10 +407,6 @@ class DirectedGraph extends abstract_graph_1.AbstractGraph {
         });
         return edgeMap;
     }
-    /**
-     * Time Complexity: O(|E|) where |E| is the number of edgeMap
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(|E|) where |E| is the number of edgeMap
      * Space Complexity: O(1)
@@ -507,10 +431,6 @@ class DirectedGraph extends abstract_graph_1.AbstractGraph {
         }
         return neighbors;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -542,10 +462,6 @@ class DirectedGraph extends abstract_graph_1.AbstractGraph {
     isEmpty() {
         return this.vertexMap.size === 0 && this.inEdgeMap.size === 0 && this.outEdgeMap.size === 0;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -569,12 +485,6 @@ class DirectedGraph extends abstract_graph_1.AbstractGraph {
         cloned.outEdgeMap = new Map(this.outEdgeMap);
         return cloned;
     }
-    /**
-     *  Time Complexity: O(V + E)
-     *  Space Complexity: O(V)
-     *  Tarjan is an algorithm based on dfs,which is used to solve the connectivity problem of graphs.
-     *  Tarjan can find the SSC(strongly connected components), articulation points, and bridges of directed graphs.
-     */
     /**
      *  Time Complexity: O(V + E)
      *  Space Complexity: O(V)
@@ -627,10 +537,6 @@ class DirectedGraph extends abstract_graph_1.AbstractGraph {
         }
         return { dfnMap, lowMap, SCCs };
     }
-    /**
-     * 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).
@@ -659,10 +565,6 @@ class DirectedGraph extends abstract_graph_1.AbstractGraph {
     getSCCs() {
         return this.tarjan().SCCs;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)

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

@@ -61,10 +61,6 @@ export declare class UndirectedGraph<V = any, E = any, VO extends UndirectedVert
      * @returns a new instance of the `UndirectedEdge` class, which is casted as type `EO`.
      */
     createEdge(v1: VertexKey, v2: VertexKey, weight?: number, value?: EO['value']): EO;
-    /**
-     * Time Complexity: O(|E|), where |E| is the number of edgeMap incident to the given vertex.
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(|E|), where |E| is the number of edgeMap incident to the given vertex.
      * Space Complexity: O(1)
@@ -77,10 +73,6 @@ export declare class UndirectedGraph<V = any, E = any, VO extends UndirectedVert
      * @returns an edge (EO) or undefined.
      */
     getEdge(v1: VO | VertexKey | undefined, v2: VO | VertexKey | undefined): EO | undefined;
-    /**
-     * Time Complexity: O(|E|), where |E| is the number of edgeMap incident to the given vertex.
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(|E|), where |E| is the number of edgeMap incident to the given vertex.
      * Space Complexity: O(1)
@@ -92,10 +84,6 @@ export declare class UndirectedGraph<V = any, E = any, VO extends UndirectedVert
      * @returns the removed edge (EO) if it exists, or undefined if either of the endpoints (VO) does not exist.
      */
     deleteEdgeBetween(v1: VO | VertexKey, v2: VO | VertexKey): EO | undefined;
-    /**
-     * Time Complexity: O(E), where E is the number of edgeMap incident to the given vertex.
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(E), where E is the number of edgeMap incident to the given vertex.
      * Space Complexity: O(1)
@@ -110,10 +98,6 @@ export declare class UndirectedGraph<V = any, E = any, VO extends UndirectedVert
      * @returns The `deleteEdge` function returns either the deleted edge object (EO) or `undefined`.
      */
     deleteEdge(edgeOrOneSideVertexKey: EO | VertexKey, otherSideVertexKey?: VertexKey): EO | undefined;
-    /**
-     * 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.
@@ -124,10 +108,6 @@ export declare class UndirectedGraph<V = any, E = any, VO extends UndirectedVert
      * @returns The method is returning a boolean value.
      */
     deleteVertex(vertexOrKey: VO | VertexKey): boolean;
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -139,10 +119,6 @@ export declare class UndirectedGraph<V = any, E = any, VO extends UndirectedVert
      * edgeMap connected to that vertex.
      */
     degreeOf(vertexOrKey: VertexKey | VO): number;
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -153,10 +129,6 @@ export declare class UndirectedGraph<V = any, E = any, VO extends UndirectedVert
      * @returns an array of edgeMap.
      */
     edgesOf(vertexOrKey: VertexKey | VO): EO[];
-    /**
-     * Time Complexity: O(|V| + |E|), where |V| is the number of vertexMap and |E| is the number of edgeMap.
-     * Space Complexity: O(|E|)
-     */
     /**
      * Time Complexity: O(|V| + |E|), where |V| is the number of vertexMap and |E| is the number of edgeMap.
      * Space Complexity: O(|E|)
@@ -165,10 +137,6 @@ export declare class UndirectedGraph<V = any, E = any, VO extends UndirectedVert
      * @returns The method `edgeSet()` returns an array of type `EO[]`.
      */
     edgeSet(): EO[];
-    /**
-     * Time Complexity: O(|V| + |E|), where |V| is the number of vertexMap and |E| is the number of edgeMap.
-     * Space Complexity: O(|E|)
-     */
     /**
      * Time Complexity: O(|V| + |E|), where |V| is the number of vertexMap and |E| is the number of edgeMap.
      * Space Complexity: O(|E|)
@@ -179,10 +147,6 @@ export declare class UndirectedGraph<V = any, E = any, VO extends UndirectedVert
      * @returns an array of vertexMap (VO[]).
      */
     getNeighbors(vertexOrKey: VO | VertexKey): VO[];
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -199,10 +163,6 @@ export declare class UndirectedGraph<V = any, E = any, VO extends UndirectedVert
      * @return True if the graph is empty and false otherwise
      */
     isEmpty(): boolean;
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -220,10 +180,6 @@ export declare class UndirectedGraph<V = any, E = any, VO extends UndirectedVert
      * @return A new instance of the undirectedgraph class
      */
     clone(): UndirectedGraph<V, E, VO, EO>;
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      *  Time Complexity: O(V + E)
      *  Space Complexity: O(V)
@@ -240,12 +196,6 @@ export declare class UndirectedGraph<V = any, E = any, VO extends UndirectedVert
         bridges: EO[];
         cutVertices: VO[];
     };
-    /**
-     *  Time Complexity: O(V + E)
-     *  Space Complexity: O(V)
-     *  Tarjan is an algorithm based on dfs,which is used to solve the connectivity problem of graphs.
-     *  1. Tarjan can find the articulation points and bridges(critical edgeMap) of undirected graphs in linear time
-     */
     /**
      * The function "getBridges" returns an array of bridges in a graph using the Tarjan's algorithm.
      * @returns The function `getBridges()` is returning the bridges found using the Tarjan's algorithm.