data-structure-typed 1.18.7 → 1.19.0

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

@@ -65,10 +65,10 @@ var DirectedVertex = /** @class */ (function (_super) {
     __extends(DirectedVertex, _super);
     /**
      * The constructor function initializes a vertex with an optional value.
-     * @param {VertexId} id - The `id` parameter is the identifier for the vertex. It is of type `VertexId`, which is
-     * typically a unique identifier for each vertex in a graph.
-     * @param {T} [val] - The "val" parameter is an optional parameter of type T. It is used to specify the value
-     * associated with the vertex.
+     * @param {VertexId} id - The `id` parameter is of type `VertexId` and represents the identifier of the vertex. It is
+     * used to uniquely identify the vertex within a graph or data structure.
+     * @param {T} [val] - The "val" parameter is an optional parameter of type T. It is used to initialize the value of the
+     * vertex. If no value is provided, the vertex will be initialized with a default value.
      */
     function DirectedVertex(id, val) {
         return _super.call(this, id, val) || this;
@@ -83,11 +83,10 @@ var DirectedEdge = /** @class */ (function (_super) {
      * and value.
      * @param {VertexId} src - The `src` parameter is the source vertex ID. It represents the starting point of an edge in
      * a graph.
-     * @param {VertexId} dest - The `dest` parameter is the identifier of the destination vertex for an edge.
-     * @param {number} [weight] - The `weight` parameter is an optional number that represents the weight of the edge. It
-     * is used to assign a numerical value to the edge, which can be used in algorithms such as shortest path algorithms.
-     * If the weight is not provided, it will default to `undefined`.
-     * @param {T} [val] - The "val" parameter is an optional parameter of type T. It represents the value associated with
+     * @param {VertexId} dest - The `dest` parameter represents the destination vertex of an edge. It is of type
+     * `VertexId`, which is likely a unique identifier for a vertex in a graph.
+     * @param {number} [weight] - The weight parameter is an optional number that represents the weight of the edge.
+     * @param {T} [val] - The `val` parameter is an optional parameter of type `T`. It represents the value associated with
      * the edge.
      */
     function DirectedEdge(src, dest, weight, val) {
@@ -119,9 +118,11 @@ var DirectedEdge = /** @class */ (function (_super) {
     return DirectedEdge;
 }(abstract_graph_1.AbstractEdge));
 exports.DirectedEdge = DirectedEdge;
-// Strongly connected, One direction connected, Weakly connected
 var DirectedGraph = /** @class */ (function (_super) {
     __extends(DirectedGraph, _super);
+    /**
+     * The constructor function initializes an instance of a class.
+     */
     function DirectedGraph() {
         var _this = _super.call(this) || this;
         _this._outEdgeMap = new Map();
@@ -145,8 +146,15 @@ var DirectedGraph = /** @class */ (function (_super) {
     /**
      * 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.
-     * @param id
-     * @param val
+     */
+    /**
+     * The function creates a new vertex with an optional value and returns it.
+     * @param {VertexId} id - The `id` parameter is the unique identifier for the vertex. It is of type `VertexId`, which
+     * could be a number or a string depending on how you want to identify your vertices.
+     * @param [val] - The 'val' parameter is an optional value that can be assigned to the vertex. If a value is provided,
+     * it will be assigned to the 'val' property of the vertex. If no value is provided, the 'val' property will be
+     * assigned the same value as the 'id' parameter
+     * @returns a new instance of a DirectedVertex object, casted as type V.
      */
     DirectedGraph.prototype.createVertex = function (id, val) {
         return new DirectedVertex(id, val !== null && val !== void 0 ? val : id);
@@ -154,21 +162,27 @@ var DirectedGraph = /** @class */ (function (_super) {
     /**
      * 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.
-     * @param src
-     * @param dest
-     * @param weight
-     * @param val
+     */
+    /**
+     * The function creates a directed edge between two vertices with an optional weight and value.
+     * @param {VertexId} src - The source vertex ID of the edge. It represents the starting point of the edge.
+     * @param {VertexId} dest - The `dest` parameter is the identifier of the destination vertex for the edge.
+     * @param {number} [weight] - The weight parameter is an optional number that represents the weight of the edge. If no
+     * weight is provided, it defaults to 1.
+     * @param [val] - The 'val' parameter is an optional value that can be assigned to the edge. It can be of any type and
+     * is used to store additional information or data associated with the edge.
+     * @returns a new instance of a DirectedEdge object, casted as type E.
      */
     DirectedGraph.prototype.createEdge = function (src, dest, weight, val) {
         return new DirectedEdge(src, dest, weight !== null && weight !== void 0 ? weight : 1, val);
     };
     /**
-     * The function `getEdge` returns the directed edge between two vertices, given their source and destination.
-     * @param {V | null | VertexId} srcOrId - The source vertex or its ID. It can be either a
-     * DirectedVertex object or a VertexId.
-     * @param {V | null | VertexId} destOrId - The `destOrId` parameter is the destination vertex or its
-     * ID. It can be either a `DirectedVertex` object or a `VertexId` value.
-     * @returns a E object or null.
+     * The `getEdge` function retrieves an edge between two vertices based on their source and destination IDs.
+     * @param {V | null | VertexId} srcOrId - The source vertex or its ID. It can be either a vertex object or a vertex ID.
+     * @param {V | null | VertexId} destOrId - The `destOrId` parameter in the `getEdge` function represents the
+     * destination vertex of the edge. It can be either a vertex object (`V`), a vertex ID (`VertexId`), or `null` if the
+     * destination is not specified.
+     * @returns the first edge found between the source and destination vertices, or null if no such edge is found.
      */
     DirectedGraph.prototype.getEdge = function (srcOrId, destOrId) {
         var edges = [];
@@ -185,49 +199,10 @@ var DirectedGraph = /** @class */ (function (_super) {
         return edges[0] || null;
     };
     /**
-     * The `addEdge` function adds a directed edge to a graph if the source and destination vertices exist.
-     * @param edge - The parameter `edge` is of type `E`, which represents a directed edge in a graph. It
-     * contains two properties:
-     * @returns The method `addEdge` returns a boolean value. It returns `true` if the edge was successfully added to the
-     * graph, and `false` if either the source or destination vertex of the edge is not present in the graph.
-     */
-    DirectedGraph.prototype.addEdge = function (edge) {
-        if (!(this.hasVertex(edge.src) && this.hasVertex(edge.dest))) {
-            return false;
-        }
-        var srcVertex = this._getVertex(edge.src);
-        var destVertex = this._getVertex(edge.dest);
-        // TODO after no-non-null-assertion not ensure the logic
-        if (srcVertex && destVertex) {
-            var srcOutEdges = this._outEdgeMap.get(srcVertex);
-            if (srcOutEdges) {
-                srcOutEdges.push(edge);
-            }
-            else {
-                this._outEdgeMap.set(srcVertex, [edge]);
-            }
-            var destInEdges = this._inEdgeMap.get(destVertex);
-            if (destInEdges) {
-                destInEdges.push(edge);
-            }
-            else {
-                this._inEdgeMap.set(destVertex, [edge]);
-            }
-            return true;
-        }
-        else {
-            return false;
-        }
-    };
-    /**
-     * The `removeEdgeBetween` function removes an edge between two vertices in a directed graph and returns the removed
-     * edge, or null if the edge was not found.
-     * @param {V | VertexId} srcOrId - The `srcOrId` parameter represents either a `V`
-     * object or a `VertexId` value. It is used to specify the source vertex of the edge that you want to remove.
-     * @param {V | VertexId} destOrId - The `destOrId` parameter represents the destination vertex of the
-     * edge that you want to remove. It can be either a `V` object or a `VertexId` value.
-     * @returns The function `removeEdgeBetween` returns the removed edge (`E`) if it exists, or `null` if
-     * the edge does not exist.
+     * The function removes an edge between two vertices in a graph and returns the removed edge.
+     * @param {V | VertexId} srcOrId - The source vertex or its ID.
+     * @param {V | VertexId} destOrId - The `destOrId` parameter represents the destination vertex or its ID.
+     * @returns the removed edge (E) if it exists, or null if either the source or destination vertex does not exist.
      */
     DirectedGraph.prototype.removeEdgeSrcToDest = function (srcOrId, destOrId) {
         var src = this._getVertex(srcOrId);
@@ -247,12 +222,10 @@ var DirectedGraph = /** @class */ (function (_super) {
         return removed;
     };
     /**
-     * The `removeEdge` function removes a directed edge from a graph and returns the removed edge, or null if the edge was
-     * not found.
-     * @param edge - The `edge` parameter is an object of type `E`, which represents a directed edge in a
-     * graph. It has two properties:
-     * @returns The function `removeEdge` returns a `E` object if an edge is successfully removed, or `null`
-     * if no edge is removed.
+     * The function removes an edge from a graph and returns the removed edge, or null if the edge was not found.
+     * @param {E} 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.
+     * @returns The method `removeEdge` returns the removed edge (`E`) if it exists, or `null` if the edge does not exist.
      */
     DirectedGraph.prototype.removeEdge = function (edge) {
         var removed = null;
@@ -271,12 +244,12 @@ var DirectedGraph = /** @class */ (function (_super) {
         return removed;
     };
     /**
-     * The function removes all edges between two vertices and returns the removed edges.
-     * @param {VertexId | V} v1 - The parameter `v1` represents either a `VertexId` or a `V` object. It is used to identify
-     * the first vertex in the graph.
-     * @param {VertexId | V} v2 - The parameter `v2` represents either a `VertexId` or a `V`. It is used to identify the
-     * second vertex involved in the edges that need to be removed.
-     * @returns The function `removeEdgesBetween` returns an array of removed edges (`E[]`).
+     * The function removes edges between two vertices and returns the removed edges.
+     * @param {VertexId | V} v1 - The parameter `v1` can be either a `VertexId` or a `V`. A `VertexId` represents the
+     * unique identifier of a vertex in a graph, while `V` represents the actual vertex object.
+     * @param {VertexId | V} v2 - The parameter `v2` represents either a `VertexId` or a `V` object. It is used to specify
+     * the second vertex in the edge that needs to be removed.
+     * @returns an array of removed edges (E[]).
      */
     DirectedGraph.prototype.removeEdgesBetween = function (v1, v2) {
         var removed = [];
@@ -289,10 +262,10 @@ var DirectedGraph = /** @class */ (function (_super) {
         return removed;
     };
     /**
-     * The function returns an array of incoming edges of a given vertex or vertex ID.
-     * @param {V | VertexId} vertexOrId - The parameter `vertexOrId` can be either a `V`
-     * object or a `VertexId`.
-     * @returns The method `incomingEdgesOf` returns an array of `E` objects.
+     * The function `incomingEdgesOf` returns an array of incoming edges for a given vertex or vertex ID.
+     * @param {V | VertexId} vertexOrId - The parameter `vertexOrId` can be either a vertex object (`V`) or a vertex ID
+     * (`VertexId`).
+     * @returns The method `incomingEdgesOf` returns an array of edges (`E[]`).
      */
     DirectedGraph.prototype.incomingEdgesOf = function (vertexOrId) {
         var target = this._getVertex(vertexOrId);
@@ -302,10 +275,10 @@ var DirectedGraph = /** @class */ (function (_super) {
         return [];
     };
     /**
-     * The function `outgoingEdgesOf` returns an array of outgoing directed edges from a given vertex or vertex ID.
-     * @param {V | VertexId} vertexOrId - The parameter `vertexOrId` can be either a `V`
-     * object or a `VertexId`.
-     * @returns The method `outgoingEdgesOf` returns an array of `E` objects.
+     * The function `outgoingEdgesOf` returns an array of outgoing edges from a given vertex or vertex ID.
+     * @param {V | VertexId} vertexOrId - The parameter `vertexOrId` can accept either a vertex object (`V`) or a vertex ID
+     * (`VertexId`).
+     * @returns The method `outgoingEdgesOf` returns an array of edges (`E[]`).
      */
     DirectedGraph.prototype.outgoingEdgesOf = function (vertexOrId) {
         var target = this._getVertex(vertexOrId);
@@ -315,64 +288,58 @@ var DirectedGraph = /** @class */ (function (_super) {
         return [];
     };
     /**
-     * The function "degreeOf" returns the total degree of a vertex in a directed graph, which is the sum of its out-degree
-     * and in-degree.
-     * @param {VertexId | V} vertexOrId - The parameter `vertexOrId` can be either a `VertexId` or a
-     * `V`.
-     * @returns The sum of the out-degree and in-degree of the given vertex or vertex ID.
+     * The function "degreeOf" returns the total degree of a vertex, which is the sum of its out-degree and in-degree.
+     * @param {VertexId | V} vertexOrId - The parameter `vertexOrId` can be either a `VertexId` or a `V`.
+     * @returns The sum of the out-degree and in-degree of the specified vertex or vertex ID.
      */
     DirectedGraph.prototype.degreeOf = function (vertexOrId) {
         return this.outDegreeOf(vertexOrId) + this.inDegreeOf(vertexOrId);
     };
     /**
-     * The function "inDegreeOf" returns the number of incoming edges for a given vertex or vertex ID in a directed graph.
-     * @param {VertexId | V} vertexOrId - The parameter `vertexOrId` can be either a `VertexId` or a
-     * `V`.
+     * The function "inDegreeOf" returns the number of incoming edges for a given vertex.
+     * @param {VertexId | V} vertexOrId - The parameter `vertexOrId` can be either a `VertexId` or a `V`.
      * @returns The number of incoming edges of the specified vertex or vertex ID.
      */
     DirectedGraph.prototype.inDegreeOf = function (vertexOrId) {
         return this.incomingEdgesOf(vertexOrId).length;
     };
     /**
-     * The function "outDegreeOf" returns the number of outgoing edges from a given vertex.
-     * @param {VertexId | V} vertexOrId - The parameter `vertexOrId` can be either a `VertexId` or a
-     * `V`.
+     * The function `outDegreeOf` returns the number of outgoing edges from a given vertex.
+     * @param {VertexId | V} vertexOrId - The parameter `vertexOrId` can be either a `VertexId` or a `V`.
      * @returns The number of outgoing edges from the specified vertex or vertex ID.
      */
     DirectedGraph.prototype.outDegreeOf = function (vertexOrId) {
         return this.outgoingEdgesOf(vertexOrId).length;
     };
     /**
-     * The function "edgesOf" returns an array of both outgoing and incoming directed edges of a given vertex or vertex ID.
-     * @param {VertexId | V} vertexOrId - The parameter `vertexOrId` can be either a `VertexId` or a
-     * `V`.
-     * @returns an array of directed edges.
+     * The function "edgesOf" returns an array of both outgoing and incoming edges of a given vertex or vertex ID.
+     * @param {VertexId | V} vertexOrId - The parameter `vertexOrId` can be either a `VertexId` or a `V`.
+     * @returns The function `edgesOf` returns an array of edges.
      */
     DirectedGraph.prototype.edgesOf = function (vertexOrId) {
         return __spreadArray(__spreadArray([], __read(this.outgoingEdgesOf(vertexOrId)), false), __read(this.incomingEdgesOf(vertexOrId)), false);
     };
     /**
-     * The function "getEdgeSrc" returns the source vertex of a directed edge, or null if the edge does not exist.
-     * @param e - A directed edge object of type E.
-     * @returns either a DirectedVertex object or null.
+     * The function "getEdgeSrc" returns the source vertex of an edge, or null if the edge does not exist.
+     * @param {E} e - The parameter "e" is of type E, which represents an edge in a graph.
+     * @returns either a vertex object (V) or null.
      */
     DirectedGraph.prototype.getEdgeSrc = function (e) {
         return this._getVertex(e.src);
     };
     /**
-     * The function "getEdgeDest" returns the destination vertex of a directed edge.
-     * @param e - E - This is an object representing a directed edge in a graph. It contains information
-     * about the source vertex, destination vertex, and any associated data.
-     * @returns either a DirectedVertex object or null.
+     * The function "getEdgeDest" returns the destination vertex of an edge.
+     * @param {E} e - The parameter "e" is of type "E", which represents an edge in a graph.
+     * @returns either a vertex object of type V or null.
      */
     DirectedGraph.prototype.getEdgeDest = function (e) {
         return this._getVertex(e.dest);
     };
     /**
-     * The function `getDestinations` returns an array of directed vertices that are the destinations of outgoing edges
-     * from a given vertex.
-     * @param {V | VertexId | null} vertex - The `vertex` parameter can be one of the following:
-     * @returns an array of DirectedVertex objects.
+     * The function `getDestinations` returns an array of destination vertices connected to a given vertex.
+     * @param {V | VertexId | null} vertex - The `vertex` parameter represents the starting vertex from which we want to
+     * find the destinations. It can be either a `V` object, a `VertexId` value, or `null`.
+     * @returns an array of vertices (V[]).
      */
     DirectedGraph.prototype.getDestinations = function (vertex) {
         var e_1, _a;
@@ -400,14 +367,17 @@ var DirectedGraph = /** @class */ (function (_super) {
         return destinations;
     };
     /**
-     * The `topologicalSort` function performs a topological sort on a directed graph and returns the sorted vertices in
-     * reverse order, or null if the graph contains a cycle.
-     * @returns The function `topologicalSort()` returns an array of `V` or `VertexId` objects in
-     * topological order, or `null` if there is a cycle in the graph.
+     * 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' | 'id'} [propertyName] - The `propertyName` parameter is an optional parameter that specifies the
+     * property to use for sorting the vertices. It can have two possible values: 'vertex' or 'id'. If 'vertex' is
+     * specified, the vertices themselves will be used for sorting. If 'id' is specified, the ids of
+     * @returns an array of vertices or vertex IDs in topological order. If there is a cycle in the graph, it returns null.
      */
-    DirectedGraph.prototype.topologicalSort = function () {
+    DirectedGraph.prototype.topologicalSort = function (propertyName) {
         var e_2, _a, e_3, _b;
         var _this = this;
+        propertyName = propertyName !== null && propertyName !== void 0 ? propertyName : 'id';
         // When judging whether there is a cycle in the undirected graph, all nodes with degree of **<= 1** are enqueued
         // When judging whether there is a cycle in the directed graph, all nodes with **in degree = 0** are enqueued
         var statusMap = new Map();
@@ -469,11 +439,13 @@ var DirectedGraph = /** @class */ (function (_super) {
         }
         if (hasCycle)
             return null;
+        if (propertyName === 'id')
+            sorted = sorted.map(function (vertex) { return vertex instanceof DirectedVertex ? vertex.id : vertex; });
         return sorted.reverse();
     };
     /**
-     * The `edgeSet` function returns an array of all directed edges in the graph.
-     * @returns The `edgeSet()` method returns an array of `E` objects.
+     * The `edgeSet` function returns an array of all the edges in the graph.
+     * @returns The `edgeSet()` method returns an array of edges (`E[]`).
      */
     DirectedGraph.prototype.edgeSet = function () {
         var edges = [];
@@ -482,12 +454,11 @@ var DirectedGraph = /** @class */ (function (_super) {
         });
         return edges;
     };
-    /**--- start find cycles --- */
     /**
-     * The function `getNeighbors` returns an array of neighboring vertices of a given vertex in a directed graph.
-     * @param {V | VertexId} vertexOrId - The parameter `vertexOrId` can be either a `V`
-     * object or a `VertexId`.
-     * @returns an array of DirectedVertex objects.
+     * The function `getNeighbors` returns an array of neighboring vertices of a given vertex or vertex ID in a graph.
+     * @param {V | VertexId} vertexOrId - The parameter `vertexOrId` can be either a vertex object (`V`) or a vertex ID
+     * (`VertexId`).
+     * @returns an array of vertices (V[]).
      */
     DirectedGraph.prototype.getNeighbors = function (vertexOrId) {
         var e_5, _a;
@@ -515,13 +486,12 @@ var DirectedGraph = /** @class */ (function (_super) {
         }
         return neighbors;
     };
-    /**--- end find cycles --- */
     /**
-     * The function "getEndsOfEdge" returns the source and destination vertices of a directed edge if it exists in the
-     * graph, otherwise it returns null.
-     * @param edge - A directed edge object with a generic type E.
-     * @returns an array containing the starting and ending vertices of the given directed edge, or null if the edge does
-     * not exist in the graph.
+     * The function "getEndsOfEdge" returns the source and destination vertices of an edge if it exists in the graph,
+     * otherwise it returns null.
+     * @param {E} edge - The parameter `edge` is of type `E`, which represents an edge in a graph.
+     * @returns The function `getEndsOfEdge` returns an array containing two vertices `[V, V]` if the edge exists in the
+     * graph. If the edge does not exist, it returns `null`.
      */
     DirectedGraph.prototype.getEndsOfEdge = function (edge) {
         if (!this.hasEdge(edge.src, edge.dest)) {
@@ -536,6 +506,41 @@ var DirectedGraph = /** @class */ (function (_super) {
             return null;
         }
     };
+    /**
+     * The function `_addEdgeOnly` adds an edge to a graph if the source and destination vertices exist.
+     * @param {E} edge - The parameter `edge` is of type `E`, which represents an edge in a graph. It is the edge that
+     * needs to be added to the graph.
+     * @returns a boolean value. It returns true if the edge was successfully added to the graph, and false if either the
+     * source or destination vertex does not exist in the graph.
+     */
+    DirectedGraph.prototype._addEdgeOnly = function (edge) {
+        if (!(this.hasVertex(edge.src) && this.hasVertex(edge.dest))) {
+            return false;
+        }
+        var srcVertex = this._getVertex(edge.src);
+        var destVertex = this._getVertex(edge.dest);
+        // TODO after no-non-null-assertion not ensure the logic
+        if (srcVertex && destVertex) {
+            var srcOutEdges = this._outEdgeMap.get(srcVertex);
+            if (srcOutEdges) {
+                srcOutEdges.push(edge);
+            }
+            else {
+                this._outEdgeMap.set(srcVertex, [edge]);
+            }
+            var destInEdges = this._inEdgeMap.get(destVertex);
+            if (destInEdges) {
+                destInEdges.push(edge);
+            }
+            else {
+                this._inEdgeMap.set(destVertex, [edge]);
+            }
+            return true;
+        }
+        else {
+            return false;
+        }
+    };
     DirectedGraph.prototype._setOutEdgeMap = function (value) {
         this._outEdgeMap = value;
     };

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

@@ -4,8 +4,8 @@ import { IUNDirectedGraph } from '../interfaces';
 export declare class UndirectedVertex<T = number> extends AbstractVertex<T> {
     /**
      * The constructor function initializes a vertex with an optional value.
-     * @param {VertexId} id - The `id` parameter is the identifier for the vertex. It is of type `VertexId`, which is
-     * typically a unique identifier for each vertex in a graph.
+     * @param {VertexId} id - The `id` parameter is of type `VertexId` and represents the identifier of the vertex. It is
+     * used to uniquely identify the vertex within a graph or network.
      * @param {T} [val] - The "val" parameter is an optional parameter of type T. It is used to initialize the value of the
      * vertex. If no value is provided, the vertex will be initialized with a default value.
      */
@@ -13,14 +13,14 @@ export declare class UndirectedVertex<T = number> extends AbstractVertex<T> {
 }
 export declare class UndirectedEdge<T = number> extends AbstractEdge<T> {
     /**
-     * The constructor function initializes an instance of a class with two vertex IDs, an optional weight, and an optional
+     * The constructor function creates an instance of a class with two vertex IDs, an optional weight, and an optional
      * value.
-     * @param {VertexId} v1 - The parameter `v1` is of type `VertexId` and represents the first vertex in the edge.
+     * @param {VertexId} v1 - The first vertex ID of the edge.
      * @param {VertexId} v2 - The parameter `v2` is a `VertexId`, which represents the identifier of the second vertex in a
      * graph edge.
      * @param {number} [weight] - The weight parameter is an optional number that represents the weight of the edge.
-     * @param {T} [val] - The "val" parameter is an optional parameter of type T. It represents the value associated with
-     * the edge.
+     * @param {T} [val] - The "val" parameter is an optional parameter of type T. It is used to store a value associated
+     * with the edge.
      */
     constructor(v1: VertexId, v2: VertexId, weight?: number, val?: T);
     private _vertices;
@@ -28,99 +28,100 @@ export declare class UndirectedEdge<T = number> extends AbstractEdge<T> {
     set vertices(v: [VertexId, VertexId]);
 }
 export declare class UndirectedGraph<V extends UndirectedVertex<any> = UndirectedVertex, E extends UndirectedEdge<any> = UndirectedEdge> extends AbstractGraph<V, E> implements IUNDirectedGraph<V, E> {
+    /**
+     * The constructor initializes a new Map object to store edges.
+     */
     constructor();
     protected _edges: Map<V, E[]>;
     get edges(): Map<V, E[]>;
     /**
-     * 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.
-     * @param id
-     * @param val
+     * The function creates a new vertex with an optional value and returns it.
+     * @param {VertexId} id - The `id` parameter is the unique identifier for the vertex. It is used to distinguish one
+     * vertex from another in the graph.
+     * @param [val] - The `val` parameter is an optional value that can be assigned to the vertex. If a value is provided,
+     * it will be used as the value of the vertex. If no value is provided, the `id` parameter will be used as the value of
+     * the vertex.
+     * @returns The method is returning a new instance of the `UndirectedVertex` class, casted as type `V`.
      */
     createVertex(id: VertexId, val?: V['val']): V;
     /**
-     * The function createEdge creates an undirected edge between two vertices with an optional weight and value.
-     * @param {VertexId} v1 - The parameter `v1` represents the first vertex of the edge. It is of type `VertexId`, which
-     * could be a unique identifier or label for the vertex.
-     * @param {VertexId} v2 - The parameter `v2` represents the second vertex of the edge. It is of type `VertexId`, which
-     * is typically a unique identifier for a vertex in a graph.
-     * @param {number} [weight] - The weight parameter is an optional number that represents the weight of the edge. If no
-     * weight is provided, the default value is 1.
+     * The function creates an undirected edge between two vertices with an optional weight and value.
+     * @param {VertexId} v1 - The parameter `v1` represents the first vertex of the edge.
+     * @param {VertexId} v2 - The parameter `v2` represents the second vertex of the edge.
+     * @param {number} [weight] - The `weight` parameter is an optional number that represents the weight of the edge. If
+     * no weight is provided, it defaults to 1.
      * @param [val] - The `val` parameter is an optional value that can be assigned to the edge. It can be of any type and
      * is used to store additional information or data associated with the edge.
-     * @returns an instance of the UndirectedEdge class, casted as type E.
+     * @returns a new instance of the `UndirectedEdge` class, which is casted as type `E`.
      */
     createEdge(v1: VertexId, v2: VertexId, weight?: number, val?: E['val']): E;
     /**
-     * The function `getEdge` returns the first undirected edge that connects two given vertices, or null if no such edge
-     * exists.
-     * @param {V | null | VertexId} v1 - The parameter `v1` represents either an `V`
-     * object, `null`, or a `VertexId`. It is used to specify one of the vertices of the edge.
-     * @param {V | null | VertexId} v2 - The parameter `v2` represents either an `UndirectedVertex`
-     * object or a `VertexId` (identifier) of an undirected vertex.
-     * @returns an instance of `E` or `null`.
+     * The function `getEdge` returns the first edge that connects two vertices, or null if no such edge exists.
+     * @param {V | null | VertexId} v1 - The parameter `v1` represents a vertex or vertex ID. It can be of type `V` (vertex
+     * object), `null`, or `VertexId` (a string or number representing the ID of a vertex).
+     * @param {V | null | VertexId} v2 - The parameter `v2` represents a vertex or vertex ID. It can be of type `V` (vertex
+     * object), `null`, or `VertexId` (vertex ID).
+     * @returns an edge (E) or null.
      */
     getEdge(v1: V | null | VertexId, v2: V | null | VertexId): E | null;
     /**
-     * The function adds an undirected edge to a graph by updating the adjacency list.
-     * @param edge - An object representing an undirected edge in a graph. It has a property called "vertices" which is an
-     * array of two vertices connected by the edge.
-     * @returns a boolean value.
-     */
-    addEdge(edge: E): boolean;
-    /**
-     * The function removes an edge between two vertices in an undirected graph.
-     * @param {V | VertexId} v1 - The parameter `v1` represents either an `V` object or
-     * a `VertexId`. It is used to specify one of the vertices of the edge that needs to be removed.
-     * @param {V | VertexId} v2 - The parameter `v2` represents either an instance of the
-     * `UndirectedVertex` class or a `VertexId`. It is used to identify the second vertex of the edge that needs to be
-     * removed.
-     * @returns The function `removeEdgeBetween` returns an `E` object if an edge is successfully removed
-     * between the two vertices `v1` and `v2`. If either `v1` or `v2` is not found in the graph, or if there is no edge
-     * between them, the function returns `null`.
+     * The function removes an edge between two vertices in a graph and returns the removed edge.
+     * @param {V | VertexId} v1 - The parameter `v1` represents either a vertex object (`V`) or a vertex ID (`VertexId`).
+     * @param {V | VertexId} v2 - V | VertexId - This parameter can be either a vertex object (V) or a vertex ID
+     * (VertexId). It represents the second vertex of the edge that needs to be removed.
+     * @returns the removed edge (E) if it exists, or null if either of the vertices (V) does not exist.
      */
     removeEdgeBetween(v1: V | VertexId, v2: V | VertexId): E | null;
     /**
-     * The removeEdge function removes an edge between two vertices in an undirected graph.
-     * @param edge - An object representing an undirected edge. It has a property called "vertices" which is an array
-     * containing the two vertices connected by the edge.
-     * @returns The method is returning an UndirectedEdge object or null.
+     * The removeEdge function removes an edge between two vertices in a graph.
+     * @param {E} edge - The parameter "edge" is of type E, which represents an edge in a graph.
+     * @returns The method is returning either the removed edge (of type E) or null if the edge was not found.
      */
     removeEdge(edge: E): E | null;
     /**
-     * The function "degreeOf" returns the degree of a given vertex in an undirected graph.
-     * @param {VertexId | V} vertexOrId - The parameter `vertexOrId` can be either a `VertexId` or an
-     * `V`.
-     * @returns the degree of the vertex.
+     * The function `degreeOf` returns the degree of a vertex in a graph, which is the number of edges connected to that
+     * vertex.
+     * @param {VertexId | V} vertexOrId - The parameter `vertexOrId` can be either a `VertexId` or a `V`.
+     * @returns The function `degreeOf` returns the degree of a vertex in a graph. The degree of a vertex is the number of
+     * edges connected to that vertex.
      */
     degreeOf(vertexOrId: VertexId | V): number;
     /**
-     * The function "edgesOf" returns an array of undirected edges connected to a given vertex or vertex ID.
-     * @param {VertexId | V} vertexOrId - The parameter `vertexOrId` can be either a `VertexId` or an
-     * `V`.
-     * @returns an array of UndirectedEdge objects.
+     * The function returns the edges of a given vertex or vertex ID.
+     * @param {VertexId | V} vertexOrId - The parameter `vertexOrId` can be either a `VertexId` or a `V`. A `VertexId` is a
+     * unique identifier for a vertex in a graph, while `V` represents the type of the vertex.
+     * @returns an array of edges.
      */
     edgesOf(vertexOrId: VertexId | V): E[];
     /**
-     * The function "edgeSet" returns an array of unique undirected edges from a set of edges.
-     * @returns The method `edgeSet()` returns an array of `E` objects.
+     * The function "edgeSet" returns an array of unique edges from a set of edges.
+     * @returns The method `edgeSet()` returns an array of type `E[]`.
      */
     edgeSet(): E[];
     /**
-     * The function `getNeighbors` returns an array of neighboring vertices of a given vertex in an undirected graph.
-     * @param {V | VertexId} vertexOrId - The `vertexOrId` parameter can be either an
-     * `V` object or a `VertexId`. It represents the vertex for which we want to find the neighbors.
-     * @returns an array of UndirectedVertex objects.
+     * The function "getNeighbors" returns an array of neighboring vertices for a given vertex or vertex ID.
+     * @param {V | VertexId} vertexOrId - The parameter `vertexOrId` can be either a vertex object (`V`) or a vertex ID
+     * (`VertexId`).
+     * @returns an array of vertices (V[]).
      */
     getNeighbors(vertexOrId: V | VertexId): V[];
     /**
-     * The function "getEndsOfEdge" returns the two vertices that form the ends of a given undirected edge, or null if the
-     * edge does not exist in the graph.
-     * @param edge - An object representing an undirected edge in a graph. It has a property called "vertices" which is an
-     * array containing two vertices that the edge connects.
-     * @returns The function `getEndsOfEdge` returns an array containing the two ends of the given `edge` if the edge
-     * exists in the graph. If the edge does not exist, it returns `null`.
+     * The function "getEndsOfEdge" returns the vertices at the ends of an edge if the edge exists in the graph, otherwise
+     * it returns null.
+     * @param {E} edge - The parameter "edge" is of type E, which represents an edge in a graph.
+     * @returns The function `getEndsOfEdge` returns an array containing two vertices `[V, V]` if the edge exists in the
+     * graph. If the edge does not exist, it returns `null`.
      */
     getEndsOfEdge(edge: E): [V, V] | null;
+    /**
+     * The function adds an edge to the graph by updating the adjacency list with the vertices of the edge.
+     * @param {E} edge - The parameter "edge" is of type E, which represents an edge in a graph.
+     * @returns a boolean value.
+     */
+    protected _addEdgeOnly(edge: E): boolean;
+    /**
+     * The function sets the edges of a graph.
+     * @param v - A map where the keys are of type V and the values are arrays of type E.
+     */
     protected _setEdges(v: Map<V, E[]>): void;
 }