data-structure-typed 1.39.4 → 1.39.6

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

@@ -16,12 +16,12 @@ class AbstractVertex {
      * The function is a protected constructor that takes an key and an optional value as parameters.
      * @param {VertexKey} key - The `key` parameter is of type `VertexKey` and represents the identifier of the vertex. It is
      * used to uniquely identify the vertex object.
-     * @param {V} [val] - The parameter "val" is an optional parameter of type V. It is used to assign a value to the
+     * @param {V} [value] - The parameter "value" is an optional parameter of type V. It is used to assign a value to the
      * vertex. If no value is provided, it will be set to undefined.
      */
-    constructor(key, val) {
+    constructor(key, value) {
         this._key = key;
-        this._val = val;
+        this._value = value;
     }
     _key;
     get key() {
@@ -30,12 +30,12 @@ class AbstractVertex {
     set key(v) {
         this._key = v;
     }
-    _val;
-    get val() {
-        return this._val;
+    _value;
+    get value() {
+        return this._value;
     }
-    set val(value) {
-        this._val = value;
+    set value(value) {
+        this._value = value;
     }
 }
 exports.AbstractVertex = AbstractVertex;
@@ -46,20 +46,20 @@ class AbstractEdge {
      * @param {number} [weight] - The `weight` parameter is an optional number that represents the weight of the object. If
      * a value is provided, it will be assigned to the `_weight` property. If no value is provided, the default value of 1
      * will be assigned.
-     * @param {V} [val] - The `val` parameter is of type `V`, which means it can be any type. It is an optional parameter,
+     * @param {VO} [value] - The `value` parameter is of type `VO`, which means it can be any type. It is an optional parameter,
      * meaning it can be omitted when creating an instance of the class.
      */
-    constructor(weight, val) {
+    constructor(weight, value) {
         this._weight = weight !== undefined ? weight : 1;
-        this._val = val;
+        this._value = value;
         this._hashCode = (0, utils_1.uuidV4)();
     }
-    _val;
-    get val() {
-        return this._val;
+    _value;
+    get value() {
+        return this._value;
     }
-    set val(value) {
-        this._val = value;
+    set value(value) {
+        this._value = value;
     }
     _weight;
     get weight() {
@@ -103,25 +103,25 @@ class AbstractGraph {
     }
     /**
      * The function checks if a vertex exists in a graph.
-     * @param {V | VertexKey} vertexOrKey - The parameter `vertexOrKey` can be either a vertex object (`V`) or a vertex ID
+     * @param {VO | VertexKey} vertexOrKey - The parameter `vertexOrKey` can be either a vertex object (`VO`) or a vertex ID
      * (`VertexKey`).
      * @returns a boolean value.
      */
     hasVertex(vertexOrKey) {
         return this._vertices.has(this._getVertexKey(vertexOrKey));
     }
-    addVertex(keyOrVertex, val) {
+    addVertex(keyOrVertex, value) {
         if (keyOrVertex instanceof AbstractVertex) {
             return this._addVertexOnly(keyOrVertex);
         }
         else {
-            const newVertex = this.createVertex(keyOrVertex, val);
+            const newVertex = this.createVertex(keyOrVertex, value);
             return this._addVertexOnly(newVertex);
         }
     }
     /**
      * The `deleteVertex` function removes a vertex from a graph by its ID or by the vertex object itself.
-     * @param {V | VertexKey} vertexOrKey - The parameter `vertexOrKey` can be either a vertex object (`V`) or a vertex ID
+     * @param {VO | VertexKey} vertexOrKey - The parameter `vertexOrKey` can be either a vertex object (`VO`) or a vertex ID
      * (`VertexKey`).
      * @returns The method is returning a boolean value.
      */
@@ -131,7 +131,7 @@ class AbstractGraph {
     }
     /**
      * The function removes all vertices from a graph and returns a boolean indicating if any vertices were removed.
-     * @param {V[] | VertexKey[]} vertices - The `vertices` parameter can be either an array of vertices (`V[]`) or an array
+     * @param {VO[] | VertexKey[]} vertices - The `vertices` parameter can be either an array of vertices (`VO[]`) or an array
      * of vertex IDs (`VertexKey[]`).
      * @returns a boolean value. It returns true if at least one vertex was successfully removed, and false if no vertices
      * were removed.
@@ -145,17 +145,17 @@ class AbstractGraph {
     }
     /**
      * The function checks if there is an edge between two vertices and returns a boolean value indicating the result.
-     * @param {VertexKey | V} v1 - The parameter v1 can be either a VertexKey or a V. A VertexKey represents the unique
-     * identifier of a vertex in a graph, while V represents the type of the vertex object itself.
-     * @param {VertexKey | V} v2 - The parameter `v2` represents the second vertex in the edge. It can be either a
-     * `VertexKey` or a `V` type, which represents the type of the vertex.
+     * @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.
+     * @param {VertexKey | VO} v2 - The parameter `v2` represents the second vertex in the edge. It can be either a
+     * `VertexKey` or a `VO` type, which represents the type of the vertex.
      * @returns A boolean value is being returned.
      */
     hasEdge(v1, v2) {
         const edge = this.getEdge(v1, v2);
         return !!edge;
     }
-    addEdge(srcOrEdge, dest, weight, val) {
+    addEdge(srcOrEdge, dest, weight, value) {
         if (srcOrEdge instanceof AbstractEdge) {
             return this._addEdgeOnly(srcOrEdge);
         }
@@ -167,7 +167,7 @@ class AbstractGraph {
                     srcOrEdge = srcOrEdge.key;
                 if (dest instanceof AbstractVertex)
                     dest = dest.key;
-                const newEdge = this.createEdge(srcOrEdge, dest, weight, val);
+                const newEdge = this.createEdge(srcOrEdge, dest, weight, value);
                 return this._addEdgeOnly(newEdge);
             }
             else {
@@ -177,10 +177,10 @@ class AbstractGraph {
     }
     /**
      * The function sets the weight of an edge between two vertices in a graph.
-     * @param {VertexKey | V} srcOrKey - The `srcOrKey` parameter can be either a `VertexKey` or a `V` object. It represents
+     * @param {VertexKey | VO} srcOrKey - The `srcOrKey` parameter can be either a `VertexKey` or a `VO` object. It represents
      * the source vertex of the edge.
-     * @param {VertexKey | V} destOrKey - The `destOrKey` parameter represents the destination vertex of the edge. It can be
-     * either a `VertexKey` or a vertex object `V`.
+     * @param {VertexKey | VO} destOrKey - The `destOrKey` parameter represents the destination vertex of the edge. It can be
+     * either a `VertexKey` or a vertex object `VO`.
      * @param {number} weight - The weight parameter represents the weight of the edge between the source vertex (srcOrKey)
      * and the destination vertex (destOrKey).
      * @returns a boolean value. If the edge exists between the source and destination vertices, the function will update
@@ -198,10 +198,10 @@ class AbstractGraph {
     }
     /**
      * The function `getAllPathsBetween` finds all paths between two vertices in a graph using depth-first search.
-     * @param {V | VertexKey} v1 - The parameter `v1` represents either a vertex object (`V`) or a vertex ID (`VertexKey`).
+     * @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.
-     * @param {V | VertexKey} v2 - The parameter `v2` represents either a vertex object (`V`) or a vertex ID (`VertexKey`).
-     * @returns The function `getAllPathsBetween` returns an array of arrays of vertices (`V[][]`).
+     * @param {VO | VertexKey} v2 - The parameter `v2` represents either a vertex object (`VO`) or a vertex ID (`VertexKey`).
+     * @returns The function `getAllPathsBetween` returns an array of arrays of vertices (`VO[][]`).
      */
     getAllPathsBetween(v1, v2) {
         const paths = [];
@@ -230,7 +230,7 @@ class AbstractGraph {
     }
     /**
      * The function calculates the sum of weights along a given path.
-     * @param {V[]} path - An array of vertices (V) representing a path in a graph.
+     * @param {VO[]} path - An array of vertices (VO) representing a path in a graph.
      * @returns The function `getPathSumWeight` returns the sum of the weights of the edges in the given path.
      */
     getPathSumWeight(path) {
@@ -243,8 +243,8 @@ class AbstractGraph {
     /**
      * 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 {V | VertexKey} v1 - The parameter `v1` represents the starting vertex or its ID.
-     * @param {V | VertexKey} v2 - The parameter `v2` represents the destination vertex or its ID. It is the vertex to which
+     * @param {VO | VertexKey} v1 - The parameter `v1` represents the starting vertex or its ID.
+     * @param {VO | VertexKey} v2 - The parameter `v2` represents the destination vertex or its ID. It is the vertex to which
      * you want to find the minimum cost or weight from the source vertex `v1`.
      * @param {boolean} [isWeight] - isWeight is an optional parameter that indicates whether the graph edges have weights.
      * If isWeight is set to true, the function will calculate the minimum cost between v1 and v2 based on the weights of
@@ -301,14 +301,14 @@ class AbstractGraph {
     /**
      * 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 {V | VertexKey} v1 - The parameter `v1` represents the starting vertex of the path. It can be either a vertex
-     * object (`V`) or a vertex ID (`VertexKey`).
-     * @param {V | VertexKey} v2 - V | VertexKey - The second vertex or vertex ID between which we want to find the minimum
+     * @param {VO | VertexKey} v1 - The parameter `v1` represents the starting vertex of the path. It can be either a vertex
+     * object (`VO`) or a vertex ID (`VertexKey`).
+     * @param {VO | VertexKey} v2 - VO | VertexKey - The second vertex or vertex ID between which we want to find the minimum
      * path.
      * @param {boolean} [isWeight] - A boolean flag indicating whether to consider the weight of edges in finding the
      * minimum path. If set to true, the function will use Dijkstra's algorithm to find the minimum weighted path. If set
      * to false, the function will use breadth-first search (BFS) to find the minimum path.
-     * @returns The function `getMinPathBetween` returns an array of vertices (`V[]`) representing the minimum path between
+     * @returns The function `getMinPathBetween` returns an array of vertices (`VO[]`) representing the minimum path between
      * two vertices (`v1` and `v2`). If there is no path between the vertices, it returns `null`.
      */
     getMinPathBetween(v1, v2, isWeight) {
@@ -358,16 +358,16 @@ class AbstractGraph {
         }
     }
     /**
-     * Dijkstra algorithm time: O(VE) space: O(V + E)
+     * Dijkstra algorithm time: O(VE) space: O(VO + EO)
      * /
   
      /**
-     * Dijkstra algorithm time: O(VE) space: O(V + E)
+     * 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 {V | VertexKey} src - The source vertex from which to start the Dijkstra's algorithm. It can be either a
+     * @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 {V | VertexKey | null} [dest] - The `dest` parameter in the `dijkstraWithoutHeap` function is an optional
+     * @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
@@ -376,7 +376,7 @@ class AbstractGraph {
      * @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<V>`.
+     * @returns The function `dijkstraWithoutHeap` returns an object of type `DijkstraResult<VO>`.
      */
     dijkstraWithoutHeap(src, dest, getMinDist, genPaths) {
         if (getMinDist === undefined)
@@ -408,10 +408,10 @@ class AbstractGraph {
         const getMinOfNoSeen = () => {
             let min = Infinity;
             let minV = null;
-            for (const [key, val] of distMap) {
+            for (const [key, value] of distMap) {
                 if (!seen.has(key)) {
-                    if (val < min) {
-                        min = val;
+                    if (value < min) {
+                        min = value;
                         minV = key;
                     }
                 }
@@ -481,11 +481,11 @@ class AbstractGraph {
         return { distMap, preMap, seen, paths, minDist, minPath };
     }
     /**
-     * Dijkstra algorithm time: O(logVE) space: O(V + E)
+     * 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.
-     * The time complexity of Dijkstra's algorithm and the Bellman-Ford algorithm depends on the size of the graph, while the time complexity of the Floyd-Warshall algorithm is O(V^3), where V is the number of nodes. For dense graphs, Floyd-Warshall might become slower.
+     * The time complexity of Dijkstra's algorithm and the Bellman-Ford algorithm depends on the size of the graph, while the time complexity of the Floyd-Warshall algorithm is O(VO^3), where VO is the number of nodes. For dense graphs, Floyd-Warshall might become slower.
      *
      * /
   
@@ -493,9 +493,9 @@ 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 {V | VertexKey} src - The `src` parameter represents the source vertex from which the Dijkstra algorithm will
+     * @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 {V | VertexKey | null} [dest] - The `dest` parameter is the destination vertex or vertex ID. It specifies the
+     * @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
@@ -504,7 +504,7 @@ class AbstractGraph {
      * @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<V>`.
+     * @returns The function `dijkstra` returns an object of type `DijkstraResult<VO>`.
      */
     dijkstra(src, dest, getMinDist, genPaths) {
         if (getMinDist === undefined)
@@ -531,12 +531,12 @@ class AbstractGraph {
                 distMap.set(vertexOrKey, Infinity);
         }
         const heap = new priority_queue_1.PriorityQueue({ comparator: (a, b) => a.key - b.key });
-        heap.add({ key: 0, val: srcVertex });
+        heap.add({ key: 0, value: srcVertex });
         distMap.set(srcVertex, 0);
         preMap.set(srcVertex, null);
         /**
          * The function `getPaths` retrieves all paths from vertices to a specified minimum vertex.
-         * @param {V | null} minV - The parameter `minV` is of type `V | null`. It represents the minimum vertex value or
+         * @param {VO | null} minV - The parameter `minV` is of type `VO | null`. It represents the minimum vertex value or
          * null.
          */
         const getPaths = (minV) => {
@@ -559,7 +559,7 @@ class AbstractGraph {
         while (heap.size > 0) {
             const curHeapNode = heap.poll();
             const dist = curHeapNode?.key;
-            const cur = curHeapNode?.val;
+            const cur = curHeapNode?.value;
             if (dist !== undefined) {
                 if (cur) {
                     seen.add(cur);
@@ -580,7 +580,7 @@ class AbstractGraph {
                                 const distSrcToNeighbor = distMap.get(neighbor);
                                 if (distSrcToNeighbor) {
                                     if (dist + weight < distSrcToNeighbor) {
-                                        heap.add({ key: dist + weight, val: neighbor });
+                                        heap.add({ key: dist + weight, value: neighbor });
                                         preMap.set(neighbor, cur);
                                         distMap.set(neighbor, dist + weight);
                                     }
@@ -608,17 +608,17 @@ class AbstractGraph {
         return { distMap, preMap, seen, paths, minDist, minPath };
     }
     /**
-     * BellmanFord time:O(VE) space:O(V)
+     * BellmanFord time:O(VE) space:O(VO)
      * one to rest pairs
      * /
   
      /**
-     * BellmanFord time:O(VE) space:O(V)
+     * BellmanFord time:O(VE) space:O(VO)
      * 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
      * all other vertices in a graph, and optionally detects negative cycles and generates the minimum path.
-     * @param {V | VertexKey} src - The `src` parameter is the source vertex from which the Bellman-Ford algorithm will
+     * @param {VO | VertexKey} src - The `src` parameter is the source vertex from which the Bellman-Ford algorithm will
      * start calculating the shortest paths. It can be either a vertex object or a vertex ID.
      * @param {boolean} [scanNegativeCycle] - A boolean flag indicating whether to scan for negative cycles in the graph.
      * @param {boolean} [getMin] - The `getMin` parameter is a boolean flag that determines whether the algorithm should
@@ -714,31 +714,31 @@ class AbstractGraph {
         return { hasNegativeCycle, distMap, preMap, paths, min, minPath };
     }
     /**
-     * Dijkstra algorithm time: O(logVE) space: O(V + E)
+     * Dijkstra algorithm time: O(logVE) space: O(VO + EO)
      * /
   
      /**
-     * Dijkstra algorithm time: O(logVE) space: O(V + E)
+     * Dijkstra algorithm time: O(logVE) space: O(VO + EO)
      * 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.
      */
     /**
-     * BellmanFord time:O(VE) space:O(V)
+     * BellmanFord time:O(VE) space:O(VO)
      * 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
      */
     /**
-     * Floyd algorithm time: O(V^3) space: O(V^2), not support graph with negative weight cycle
+     * Floyd algorithm time: O(VO^3) space: O(VO^2), 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(V^3) space: O(V^2), not support graph with negative weight cycle
+     * Floyd algorithm time: O(VO^3) space: O(VO^2), not support graph with negative weight cycle
      * all pairs
      * /
   
      /**
-     * Floyd algorithm time: O(V^3) space: O(V^2), not support graph with negative weight cycle
+     * Floyd algorithm time: O(VO^3) space: O(VO^2), 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

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

@@ -6,12 +6,12 @@ export declare class DirectedVertex<V = any> extends AbstractVertex<V> {
      * The constructor function initializes a vertex with an optional value.
      * @param {VertexKey} key - The `key` parameter is of type `VertexKey` and represents the identifier of the vertex. It is
      * used to uniquely identify the vertex within a graph or data structure.
-     * @param {V} [val] - The "val" parameter is an optional parameter of type V. It is used to initialize the value of the
+     * @param {V} [value] - The "value" parameter is an optional parameter of type V. It is used to initialize the value of the
      * vertex. If no value is provided, the vertex will be initialized with a default value.
      */
-    constructor(key: VertexKey, val?: V);
+    constructor(key: VertexKey, value?: V);
 }
-export declare class DirectedEdge<V = any> extends AbstractEdge<V> {
+export declare class DirectedEdge<E = any> extends AbstractEdge<E> {
     /**
      * The constructor function initializes the source and destination vertices of an edge, along with an optional weight
      * and value.
@@ -20,10 +20,10 @@ export declare class DirectedEdge<V = any> extends AbstractEdge<V> {
      * @param {VertexKey} dest - The `dest` parameter represents the destination vertex of an edge. It is of type
      * `VertexKey`, 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 {V} [val] - The `val` parameter is an optional parameter of type `V`. It represents the value associated with
+     * @param {E} [value] - The `value` parameter is an optional parameter of type `E`. It represents the value associated with
      * the edge.
      */
-    constructor(src: VertexKey, dest: VertexKey, weight?: number, val?: V);
+    constructor(src: VertexKey, dest: VertexKey, weight?: number, value?: E);
     private _src;
     get src(): VertexKey;
     set src(v: VertexKey);
@@ -31,15 +31,15 @@ export declare class DirectedEdge<V = any> extends AbstractEdge<V> {
     get dest(): VertexKey;
     set dest(v: VertexKey);
 }
-export declare class DirectedGraph<V extends DirectedVertex<any> = DirectedVertex, E extends DirectedEdge<any> = DirectedEdge> extends AbstractGraph<V, E> implements IGraph<V, E> {
+export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V> = DirectedVertex<V>, EO extends DirectedEdge<E> = DirectedEdge<E>> extends AbstractGraph<V, E, VO, EO> implements IGraph<V, E, VO, EO> {
     /**
      * The constructor function initializes an instance of a class.
      */
     constructor();
     private _outEdgeMap;
-    get outEdgeMap(): Map<V, E[]>;
+    get outEdgeMap(): Map<VO, EO[]>;
     private _inEdgeMap;
-    get inEdgeMap(): Map<V, E[]>;
+    get inEdgeMap(): 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.
@@ -48,12 +48,12 @@ export declare class DirectedGraph<V extends DirectedVertex<any> = DirectedVerte
      * 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
      * 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
+     * @param [value] - The 'value' parameter is an optional value that can be assigned to the vertex. If a value is provided,
+     * it will be assigned to the 'value' property of the vertex. If no value is provided, the 'value' property will be
      * assigned the same value as the 'key' parameter
-     * @returns a new instance of a DirectedVertex object, casted as type V.
+     * @returns a new instance of a DirectedVertex object, casted as type VO.
      */
-    createVertex(key: VertexKey, val?: V['val']): V;
+    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.
@@ -64,100 +64,100 @@ export declare class DirectedGraph<V extends DirectedVertex<any> = DirectedVerte
      * @param {VertexKey} 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
+     * @param [value] - The 'value' 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.
+     * @returns a new instance of a DirectedEdge object, casted as type EO.
      */
-    createEdge(src: VertexKey, dest: VertexKey, weight?: number, val?: E['val']): E;
+    createEdge(src: VertexKey, dest: VertexKey, weight?: number, value?: E): EO;
     /**
      * The `getEdge` function retrieves an edge between two vertices based on their source and destination IDs.
-     * @param {V | null | VertexKey} srcOrKey - The source vertex or its ID. It can be either a vertex object or a vertex ID.
-     * @param {V | null | VertexKey} destOrKey - The `destOrKey` parameter in the `getEdge` function represents the
-     * destination vertex of the edge. It can be either a vertex object (`V`), a vertex ID (`VertexKey`), or `null` if the
+     * @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
+     * destination vertex of the edge. It can be either a vertex object (`VO`), a vertex ID (`VertexKey`), 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.
      */
-    getEdge(srcOrKey: V | null | VertexKey, destOrKey: V | null | VertexKey): E | null;
+    getEdge(srcOrKey: VO | VertexKey | null, destOrKey: VO | VertexKey | null): EO | null;
     /**
      * The function removes an edge between two vertices in a graph and returns the removed edge.
-     * @param {V | VertexKey} srcOrKey - The source vertex or its ID.
-     * @param {V | VertexKey} destOrKey - The `destOrKey` 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.
+     * @param {VO | VertexKey} srcOrKey - The source vertex or its ID.
+     * @param {VO | VertexKey} destOrKey - The `destOrKey` parameter represents the destination vertex or its ID.
+     * @returns the removed edge (EO) if it exists, or null if either the source or destination vertex does not exist.
      */
-    deleteEdgeSrcToDest(srcOrKey: V | VertexKey, destOrKey: V | VertexKey): E | null;
+    deleteEdgeSrcToDest(srcOrKey: VO | VertexKey, destOrKey: VO | VertexKey): EO | null;
     /**
      * 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`
+     * @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.
-     * @returns The method `deleteEdge` returns the removed edge (`E`) if it exists, or `null` if the edge does not exist.
+     * @returns The method `deleteEdge` returns the removed edge (`EO`) if it exists, or `null` if the edge does not exist.
      */
-    deleteEdge(edge: E): E | null;
+    deleteEdge(edge: EO): EO | null;
     /**
      * The function removes edges between two vertices and returns the removed edges.
-     * @param {VertexKey | V} v1 - The parameter `v1` can be either a `VertexKey` or a `V`. A `VertexKey` represents the
-     * unique identifier of a vertex in a graph, while `V` represents the actual vertex object.
-     * @param {VertexKey | V} v2 - The parameter `v2` represents either a `VertexKey` or a `V` object. It is used to specify
+     * @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.
+     * @param {VertexKey | VO} v2 - The parameter `v2` represents either a `VertexKey` or a `VO` object. It is used to specify
      * the second vertex in the edge that needs to be removed.
-     * @returns an array of removed edges (E[]).
+     * @returns an array of removed edges (EO[]).
      */
-    deleteEdgesBetween(v1: VertexKey | V, v2: VertexKey | V): E[];
+    deleteEdgesBetween(v1: VertexKey | VO, v2: VertexKey | VO): EO[];
     /**
      * The function `incomingEdgesOf` returns an array of incoming edges for a given vertex or vertex ID.
-     * @param {V | VertexKey} vertexOrKey - The parameter `vertexOrKey` can be either a vertex object (`V`) or a vertex ID
+     * @param {VO | VertexKey} vertexOrKey - The parameter `vertexOrKey` can be either a vertex object (`VO`) or a vertex ID
      * (`VertexKey`).
-     * @returns The method `incomingEdgesOf` returns an array of edges (`E[]`).
+     * @returns The method `incomingEdgesOf` returns an array of edges (`EO[]`).
      */
-    incomingEdgesOf(vertexOrKey: V | VertexKey): E[];
+    incomingEdgesOf(vertexOrKey: VO | VertexKey): EO[];
     /**
      * The function `outgoingEdgesOf` returns an array of outgoing edges from a given vertex or vertex ID.
-     * @param {V | VertexKey} vertexOrKey - The parameter `vertexOrKey` can accept either a vertex object (`V`) or a vertex ID
+     * @param {VO | VertexKey} vertexOrKey - The parameter `vertexOrKey` can accept either a vertex object (`VO`) or a vertex ID
      * (`VertexKey`).
-     * @returns The method `outgoingEdgesOf` returns an array of edges (`E[]`).
+     * @returns The method `outgoingEdgesOf` returns an array of edges (`EO[]`).
      */
-    outgoingEdgesOf(vertexOrKey: V | VertexKey): E[];
+    outgoingEdgesOf(vertexOrKey: VO | VertexKey): EO[];
     /**
      * The function "degreeOf" returns the total degree of a vertex, which is the sum of its out-degree and in-degree.
-     * @param {VertexKey | V} vertexOrKey - The parameter `vertexOrKey` can be either a `VertexKey` or a `V`.
+     * @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 | V): number;
+    degreeOf(vertexOrKey: VertexKey | VO): number;
     /**
      * The function "inDegreeOf" returns the number of incoming edges for a given vertex.
-     * @param {VertexKey | V} vertexOrKey - The parameter `vertexOrKey` can be either a `VertexKey` or a `V`.
+     * @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 | V): number;
+    inDegreeOf(vertexOrKey: VertexKey | VO): number;
     /**
      * The function `outDegreeOf` returns the number of outgoing edges from a given vertex.
-     * @param {VertexKey | V} vertexOrKey - The parameter `vertexOrKey` can be either a `VertexKey` or a `V`.
+     * @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 | V): number;
+    outDegreeOf(vertexOrKey: VertexKey | VO): number;
     /**
      * The function "edgesOf" returns an array of both outgoing and incoming edges of a given vertex or vertex ID.
-     * @param {VertexKey | V} vertexOrKey - The parameter `vertexOrKey` can be either a `VertexKey` or a `V`.
+     * @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 | V): E[];
+    edgesOf(vertexOrKey: VertexKey | VO): EO[];
     /**
      * 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.
+     * @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: E): V | null;
+    getEdgeSrc(e: EO): VO | 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.
+     * @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: E): V | null;
+    getEdgeDest(e: EO): VO | null;
     /**
      * The function `getDestinations` returns an array of destination vertices connected to a given vertex.
-     * @param {V | VertexKey | 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 `VertexKey` value, or `null`.
-     * @returns an array of vertices (V[]).
+     * @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`.
+     * @returns an array of vertices (VO[]).
      */
-    getDestinations(vertex: V | VertexKey | null): V[];
+    getDestinations(vertex: VO | VertexKey | null): VO[];
     /**
      * 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.
@@ -166,35 +166,35 @@ export declare class DirectedGraph<V extends DirectedVertex<any> = DirectedVerte
      * specified, the vertices themselves will be used for sorting. If 'key' 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.
      */
-    topologicalSort(propertyName?: 'vertex' | 'key'): Array<V | VertexKey> | null;
+    topologicalSort(propertyName?: 'vertex' | 'key'): Array<VO | VertexKey> | null;
     /**
      * The `edgeSet` function returns an array of all the edges in the graph.
-     * @returns The `edgeSet()` method returns an array of edges (`E[]`).
+     * @returns The `edgeSet()` method returns an array of edges (`EO[]`).
      */
-    edgeSet(): E[];
+    edgeSet(): EO[];
     /**
      * The function `getNeighbors` returns an array of neighboring vertices of a given vertex or vertex ID in a graph.
-     * @param {V | VertexKey} vertexOrKey - The parameter `vertexOrKey` can be either a vertex object (`V`) or a vertex ID
+     * @param {VO | VertexKey} vertexOrKey - The parameter `vertexOrKey` can be either a vertex object (`VO`) or a vertex ID
      * (`VertexKey`).
-     * @returns an array of vertices (V[]).
+     * @returns an array of vertices (VO[]).
      */
-    getNeighbors(vertexOrKey: V | VertexKey): V[];
+    getNeighbors(vertexOrKey: VO | VertexKey): VO[];
     /**
      * 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
+     * @param {EO} edge - The parameter `edge` is of type `EO`, which represents an edge in a graph.
+     * @returns The function `getEndsOfEdge` returns an array containing two vertices `[VO, VO]` if the edge exists in the
      * graph. If the edge does not exist, it returns `null`.
      */
-    getEndsOfEdge(edge: E): [V, V] | null;
+    getEndsOfEdge(edge: EO): [VO, VO] | 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
+     * @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.
      * @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.
      */
-    protected _addEdgeOnly(edge: E): boolean;
-    protected _setOutEdgeMap(value: Map<V, E[]>): void;
-    protected _setInEdgeMap(value: Map<V, E[]>): void;
+    protected _addEdgeOnly(edge: EO): boolean;
+    protected _setOutEdgeMap(value: Map<VO, EO[]>): void;
+    protected _setInEdgeMap(value: Map<VO, EO[]>): void;
 }