graph-typed 1.39.5 → 1.40.0

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

@@ -16,24 +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) {
-        this._key = key;
-        this._val = val;
-    }
-    get key() {
-        return this._key;
-    }
-    set key(v) {
-        this._key = v;
-    }
-    get val() {
-        return this._val;
-    }
-    set val(value) {
-        this._val = value;
+    constructor(key, value) {
+        this.key = key;
+        this.value = value;
     }
 }
 exports.AbstractVertex = AbstractVertex;
@@ -44,41 +32,17 @@ 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 {VO} [val] - The `val` parameter is of type `VO`, 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) {
-        this._weight = weight !== undefined ? weight : 1;
-        this._val = val;
+    constructor(weight, value) {
+        this.weight = weight !== undefined ? weight : 1;
+        this.value = value;
         this._hashCode = (0, utils_1.uuidV4)();
     }
-    get val() {
-        return this._val;
-    }
-    set val(value) {
-        this._val = value;
-    }
-    get weight() {
-        return this._weight;
-    }
-    set weight(v) {
-        this._weight = v;
-    }
     get hashCode() {
         return this._hashCode;
     }
-    /**
-     * 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 sets the value of the _hashCode property to the provided string.
-     * @param {string} v - The parameter "v" is of type string and represents the value that will be assigned to the
-     * "_hashCode" property.
-     */
-    _setHashCode(v) {
-        this._hashCode = v;
-    }
 }
 exports.AbstractEdge = AbstractEdge;
 class AbstractGraph {
@@ -107,12 +71,12 @@ class AbstractGraph {
     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);
         }
     }
@@ -152,7 +116,7 @@ class AbstractGraph {
         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);
         }
@@ -164,7 +128,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 {
@@ -406,10 +370,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;
                     }
                 }
@@ -530,7 +494,7 @@ 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);
         /**
@@ -558,7 +522,7 @@ class AbstractGraph {
         while (heap.size > 0) {
             const curHeapNode = heap.poll();
             const dist = curHeapNode === null || curHeapNode === void 0 ? void 0 : curHeapNode.key;
-            const cur = curHeapNode === null || curHeapNode === void 0 ? void 0 : curHeapNode.val;
+            const cur = curHeapNode === null || curHeapNode === void 0 ? void 0 : curHeapNode.value;
             if (dist !== undefined) {
                 if (cur) {
                     seen.add(cur);
@@ -579,7 +543,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);
                                     }
@@ -916,8 +880,5 @@ class AbstractGraph {
     _getVertexKey(vertexOrKey) {
         return vertexOrKey instanceof AbstractVertex ? vertexOrKey.key : vertexOrKey;
     }
-    _setVertices(value) {
-        this._vertices = value;
-    }
 }
 exports.AbstractGraph = AbstractGraph;

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

@@ -6,12 +6,14 @@ 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<E = any> extends AbstractEdge<E> {
+    src: VertexKey;
+    dest: VertexKey;
     /**
      * The constructor function initializes the source and destination vertices of an edge, along with an optional weight
      * and value.
@@ -20,25 +22,19 @@ export declare class DirectedEdge<E = any> extends AbstractEdge<E> {
      * @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 {E} [val] - The `val` parameter is an optional parameter of type `E`. 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?: E);
-    private _src;
-    get src(): VertexKey;
-    set src(v: VertexKey);
-    private _dest;
-    get dest(): VertexKey;
-    set dest(v: VertexKey);
+    constructor(src: VertexKey, dest: VertexKey, weight?: number, value?: 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;
+    protected _outEdgeMap: Map<VO, EO[]>;
     get outEdgeMap(): Map<VO, EO[]>;
-    private _inEdgeMap;
+    protected _inEdgeMap: Map<VO, EO[]>;
     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.
@@ -48,12 +44,12 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
      * 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 VO.
      */
-    createVertex(key: VertexKey, val?: V): 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.
@@ -64,20 +60,20 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
      * @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 EO.
      */
-    createEdge(src: VertexKey, dest: VertexKey, weight?: number, val?: E): EO;
+    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 {VO | null | VertexKey} srcOrKey - The source vertex or its ID. It can be either a vertex object or a vertex ID.
-     * @param {VO | null | VertexKey} destOrKey - The `destOrKey` parameter in the `getEdge` function represents 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: VO | null | VertexKey, destOrKey: VO | null | VertexKey): EO | 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 {VO | VertexKey} srcOrKey - The source vertex or its ID.
@@ -195,6 +191,4 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
      * source or destination vertex does not exist in the graph.
      */
     protected _addEdgeOnly(edge: EO): boolean;
-    protected _setOutEdgeMap(value: Map<VO, EO[]>): void;
-    protected _setInEdgeMap(value: Map<VO, EO[]>): void;
 }

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

@@ -15,11 +15,11 @@ class DirectedVertex extends abstract_graph_1.AbstractVertex {
      * 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, val) {
-        super(key, val);
+    constructor(key, value) {
+        super(key, value);
     }
 }
 exports.DirectedVertex = DirectedVertex;
@@ -32,25 +32,13 @@ class DirectedEdge extends abstract_graph_1.AbstractEdge {
      * @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 {E} [val] - The `val` parameter is an optional parameter of type `E`. 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, dest, weight, val) {
-        super(weight, val);
-        this._src = src;
-        this._dest = dest;
-    }
-    get src() {
-        return this._src;
-    }
-    set src(v) {
-        this._src = v;
-    }
-    get dest() {
-        return this._dest;
-    }
-    set dest(v) {
-        this._dest = v;
+    constructor(src, dest, weight, value) {
+        super(weight, value);
+        this.src = src;
+        this.dest = dest;
     }
 }
 exports.DirectedEdge = DirectedEdge;
@@ -77,13 +65,13 @@ class DirectedGraph extends abstract_graph_1.AbstractGraph {
      * 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 VO.
      */
-    createVertex(key, val) {
-        return new DirectedVertex(key, val !== null && val !== void 0 ? val : key);
+    createVertex(key, value) {
+        return new DirectedVertex(key, value !== null && value !== void 0 ? value : key);
     }
     /**
      * 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.
@@ -95,17 +83,17 @@ class DirectedGraph extends abstract_graph_1.AbstractGraph {
      * @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 EO.
      */
-    createEdge(src, dest, weight, val) {
-        return new DirectedEdge(src, dest, weight !== null && weight !== void 0 ? weight : 1, val);
+    createEdge(src, dest, weight, value) {
+        return new DirectedEdge(src, dest, weight !== null && weight !== void 0 ? weight : 1, value);
     }
     /**
      * The `getEdge` function retrieves an edge between two vertices based on their source and destination IDs.
-     * @param {VO | null | VertexKey} srcOrKey - The source vertex or its ID. It can be either a vertex object or a vertex ID.
-     * @param {VO | null | VertexKey} destOrKey - The `destOrKey` parameter in the `getEdge` function represents 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.
@@ -412,11 +400,5 @@ class DirectedGraph extends abstract_graph_1.AbstractGraph {
             return false;
         }
     }
-    _setOutEdgeMap(value) {
-        this._outEdgeMap = value;
-    }
-    _setInEdgeMap(value) {
-        this._inEdgeMap = value;
-    }
 }
 exports.DirectedGraph = DirectedGraph;

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

@@ -1,6 +1,8 @@
 import { MapGraphCoordinate, VertexKey } from '../../types';
 import { DirectedEdge, DirectedGraph, DirectedVertex } from './directed-graph';
 export declare class MapVertex<V = any> extends DirectedVertex<V> {
+    lat: number;
+    long: number;
     /**
      * The constructor function initializes an object with an key, latitude, longitude, and an optional value.
      * @param {VertexKey} key - The `key` parameter is of type `VertexKey` and represents the identifier of the vertex.
@@ -10,16 +12,10 @@ export declare class MapVertex<V = any> extends DirectedVertex<V> {
      * @param {number} long - The "long" parameter represents the longitude of a location. Longitude is a geographic
      * coordinate that specifies the east-west position of a point on the Earth's surface. It is measured in degrees, with
      * values ranging from -180 to 180.
-     * @param {V} [val] - The "val" parameter is an optional value of type V. It is not required to be provided when
+     * @param {V} [value] - The "value" parameter is an optional value of type V. It is not required to be provided when
      * creating an instance of the class.
      */
-    constructor(key: VertexKey, val: V, lat: number, long: number);
-    private _lat;
-    get lat(): number;
-    set lat(value: number);
-    private _long;
-    get long(): number;
-    set long(value: number);
+    constructor(key: VertexKey, value: V, lat: number, long: number);
 }
 export declare class MapEdge<E = any> extends DirectedEdge<E> {
     /**
@@ -29,10 +25,10 @@ export declare class MapEdge<E = any> extends DirectedEdge<E> {
      * a graph.
      * @param {VertexKey} 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.
-     * @param {E} [val] - The "val" parameter is an optional parameter of type E. It is used to store additional
+     * @param {E} [value] - The "value" parameter is an optional parameter of type E. It is used to store additional
      * information or data associated with the edge.
      */
-    constructor(src: VertexKey, dest: VertexKey, weight?: number, val?: E);
+    constructor(src: VertexKey, dest: VertexKey, weight?: number, value?: E);
 }
 export declare class MapGraph<V = any, E = any, VO extends MapVertex<V> = MapVertex<V>, EO extends MapEdge<E> = MapEdge<E>> extends DirectedGraph<V, E, VO, EO> {
     /**
@@ -45,24 +41,22 @@ export declare class MapGraph<V = any, E = any, VO extends MapVertex<V> = MapVer
      * it will default to `undefined`.
      */
     constructor(origin: MapGraphCoordinate, bottomRight?: MapGraphCoordinate);
-    private _origin;
+    protected _origin: MapGraphCoordinate;
     get origin(): MapGraphCoordinate;
-    set origin(value: MapGraphCoordinate);
-    private _bottomRight;
+    protected _bottomRight: MapGraphCoordinate | undefined;
     get bottomRight(): MapGraphCoordinate | undefined;
-    set bottomRight(value: MapGraphCoordinate | undefined);
     /**
      * The function creates a new vertex with the given key, value, latitude, and longitude.
      * @param {VertexKey} key - The key parameter is the unique identifier for the vertex. It is of type VertexKey, which could
      * be a string or a number depending on how you define it in your code.
-     * @param [val] - The `val` parameter is an optional value that can be assigned to the `val` property of the vertex. It
-     * is of type `V`, which means it should be of the same type as the `val` property of the vertex class `VO`.
+     * @param [value] - The `value` parameter is an optional value that can be assigned to the `value` property of the vertex. It
+     * is of type `V`, which means it should be of the same type as the `value` property of the vertex class `VO`.
      * @param {number} lat - The `lat` parameter represents the latitude of the vertex. It is a number that specifies the
      * position of the vertex on the Earth's surface in the north-south direction.
      * @param {number} long - The `long` parameter represents the longitude coordinate of the vertex.
      * @returns The method is returning a new instance of the `MapVertex` class, casted as type `VO`.
      */
-    createVertex(key: VertexKey, val?: V, lat?: number, long?: number): VO;
+    createVertex(key: VertexKey, value?: V, lat?: number, long?: number): VO;
     /**
      * The function creates a new instance of a MapEdge with the given source, destination, weight, and value.
      * @param {VertexKey} src - The source vertex ID of the edge. It represents the starting point of the edge.
@@ -71,9 +65,9 @@ export declare class MapGraph<V = any, E = any, VO extends MapVertex<V> = MapVer
      * @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 can be set to a default value or left undefined.
-     * @param [val] - The `val` parameter is an optional value that can be assigned to the edge. It can be of any type,
+     * @param [value] - The `value` parameter is an optional value that can be assigned to the edge. It can be of any type,
      * depending on the specific implementation of the `MapEdge` class.
      * @returns a new instance of the `MapEdge` class, cast as type `EO`.
      */
-    createEdge(src: VertexKey, dest: VertexKey, weight?: number, val?: E): EO;
+    createEdge(src: VertexKey, dest: VertexKey, weight?: number, value?: E): EO;
 }

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

@@ -12,25 +12,13 @@ class MapVertex extends directed_graph_1.DirectedVertex {
      * @param {number} long - The "long" parameter represents the longitude of a location. Longitude is a geographic
      * coordinate that specifies the east-west position of a point on the Earth's surface. It is measured in degrees, with
      * values ranging from -180 to 180.
-     * @param {V} [val] - The "val" parameter is an optional value of type V. It is not required to be provided when
+     * @param {V} [value] - The "value" parameter is an optional value of type V. It is not required to be provided when
      * creating an instance of the class.
      */
-    constructor(key, val, lat, long) {
-        super(key, val);
-        this._lat = lat;
-        this._long = long;
-    }
-    get lat() {
-        return this._lat;
-    }
-    set lat(value) {
-        this._lat = value;
-    }
-    get long() {
-        return this._long;
-    }
-    set long(value) {
-        this._long = value;
+    constructor(key, value, lat, long) {
+        super(key, value);
+        this.lat = lat;
+        this.long = long;
     }
 }
 exports.MapVertex = MapVertex;
@@ -42,11 +30,11 @@ class MapEdge extends directed_graph_1.DirectedEdge {
      * a graph.
      * @param {VertexKey} 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.
-     * @param {E} [val] - The "val" parameter is an optional parameter of type E. It is used to store additional
+     * @param {E} [value] - The "value" parameter is an optional parameter of type E. It is used to store additional
      * information or data associated with the edge.
      */
-    constructor(src, dest, weight, val) {
-        super(src, dest, weight, val);
+    constructor(src, dest, weight, value) {
+        super(src, dest, weight, value);
     }
 }
 exports.MapEdge = MapEdge;
@@ -69,28 +57,22 @@ class MapGraph extends directed_graph_1.DirectedGraph {
     get origin() {
         return this._origin;
     }
-    set origin(value) {
-        this._origin = value;
-    }
     get bottomRight() {
         return this._bottomRight;
     }
-    set bottomRight(value) {
-        this._bottomRight = value;
-    }
     /**
      * The function creates a new vertex with the given key, value, latitude, and longitude.
      * @param {VertexKey} key - The key parameter is the unique identifier for the vertex. It is of type VertexKey, which could
      * be a string or a number depending on how you define it in your code.
-     * @param [val] - The `val` parameter is an optional value that can be assigned to the `val` property of the vertex. It
-     * is of type `V`, which means it should be of the same type as the `val` property of the vertex class `VO`.
+     * @param [value] - The `value` parameter is an optional value that can be assigned to the `value` property of the vertex. It
+     * is of type `V`, which means it should be of the same type as the `value` property of the vertex class `VO`.
      * @param {number} lat - The `lat` parameter represents the latitude of the vertex. It is a number that specifies the
      * position of the vertex on the Earth's surface in the north-south direction.
      * @param {number} long - The `long` parameter represents the longitude coordinate of the vertex.
      * @returns The method is returning a new instance of the `MapVertex` class, casted as type `VO`.
      */
-    createVertex(key, val, lat = this.origin[0], long = this.origin[1]) {
-        return new MapVertex(key, val, lat, long);
+    createVertex(key, value, lat = this.origin[0], long = this.origin[1]) {
+        return new MapVertex(key, value, lat, long);
     }
     /**
      * The function creates a new instance of a MapEdge with the given source, destination, weight, and value.
@@ -100,12 +82,12 @@ class MapGraph extends directed_graph_1.DirectedGraph {
      * @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 can be set to a default value or left undefined.
-     * @param [val] - The `val` parameter is an optional value that can be assigned to the edge. It can be of any type,
+     * @param [value] - The `value` parameter is an optional value that can be assigned to the edge. It can be of any type,
      * depending on the specific implementation of the `MapEdge` class.
      * @returns a new instance of the `MapEdge` class, cast as type `EO`.
      */
-    createEdge(src, dest, weight, val) {
-        return new MapEdge(src, dest, weight, val);
+    createEdge(src, dest, weight, value) {
+        return new MapEdge(src, dest, weight, value);
     }
 }
 exports.MapGraph = MapGraph;

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

@@ -6,12 +6,13 @@ export declare class UndirectedVertex<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 network.
-     * @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 UndirectedEdge<E = number> extends AbstractEdge<E> {
+    vertices: [VertexKey, VertexKey];
     /**
      * The constructor function creates an instance of a class with two vertex IDs, an optional weight, and an optional
      * value.
@@ -19,13 +20,10 @@ export declare class UndirectedEdge<E = number> extends AbstractEdge<E> {
      * @param {VertexKey} v2 - The parameter `v2` is a `VertexKey`, 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 {E} [val] - The "val" parameter is an optional parameter of type E. It is used to store a value associated
+     * @param {E} [value] - The "value" parameter is an optional parameter of type E. It is used to store a value associated
      * with the edge.
      */
-    constructor(v1: VertexKey, v2: VertexKey, weight?: number, val?: E);
-    private _vertices;
-    get vertices(): [VertexKey, VertexKey];
-    set vertices(v: [VertexKey, VertexKey]);
+    constructor(v1: VertexKey, v2: VertexKey, weight?: number, value?: E);
 }
 export declare class UndirectedGraph<V = any, E = any, VO extends UndirectedVertex<V> = UndirectedVertex<V>, EO extends UndirectedEdge<E> = UndirectedEdge<E>> extends AbstractGraph<V, E, VO, EO> implements IGraph<V, E, VO, EO> {
     /**
@@ -38,32 +36,32 @@ export declare class UndirectedGraph<V = any, E = any, VO extends UndirectedVert
      * 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 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,
+     * @param [value] - The `value` 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 `key` 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 `VO`.
      */
-    createVertex(key: VertexKey, val?: VO['val']): VO;
+    createVertex(key: VertexKey, value?: VO['value']): VO;
     /**
      * The function creates an undirected edge between two vertices with an optional weight and value.
      * @param {VertexKey} v1 - The parameter `v1` represents the first vertex of the edge.
      * @param {VertexKey} 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
+     * @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 the `UndirectedEdge` class, which is casted as type `EO`.
      */
-    createEdge(v1: VertexKey, v2: VertexKey, weight?: number, val?: EO['val']): EO;
+    createEdge(v1: VertexKey, v2: VertexKey, weight?: number, value?: EO['value']): EO;
     /**
      * The function `getEdge` returns the first edge that connects two vertices, or null if no such edge exists.
-     * @param {VO | null | VertexKey} v1 - The parameter `v1` represents a vertex or vertex ID. It can be of type `VO` (vertex
+     * @param {VO | VertexKey | null} v1 - The parameter `v1` represents a vertex or vertex ID. It can be of type `VO` (vertex
      * object), `null`, or `VertexKey` (a string or number representing the ID of a vertex).
-     * @param {VO | null | VertexKey} v2 - The parameter `v2` represents a vertex or vertex ID. It can be of type `VO` (vertex
+     * @param {VO | VertexKey | null} v2 - The parameter `v2` represents a vertex or vertex ID. It can be of type `VO` (vertex
      * object), `null`, or `VertexKey` (vertex ID).
      * @returns an edge (EO) or null.
      */
-    getEdge(v1: VO | null | VertexKey, v2: VO | null | VertexKey): EO | null;
+    getEdge(v1: VO | VertexKey | null, v2: VO | VertexKey | null): EO | null;
     /**
      * The function removes an edge between two vertices in a graph and returns the removed edge.
      * @param {VO | VertexKey} v1 - The parameter `v1` represents either a vertex object (`VO`) or a vertex ID (`VertexKey`).
@@ -119,9 +117,4 @@ export declare class UndirectedGraph<V = any, E = any, VO extends UndirectedVert
      * @returns a boolean value.
      */
     protected _addEdgeOnly(edge: EO): boolean;
-    /**
-     * The function sets the edges of a graph.
-     * @param v - A map where the keys are of type VO and the values are arrays of type EO.
-     */
-    protected _setEdges(v: Map<VO, EO[]>): void;
 }