data-structure-typed 1.39.4 → 1.39.6

package/src/data-structures/linked-list/singly-linked-list.ts

@@ -8,22 +8,22 @@
 export class SinglyLinkedListNode<E = any> {
   /**
    * The constructor function initializes an instance of a class with a given value and sets the next property to null.
-   * @param {E} val - The "val" parameter is of type E, which means it can be any data type. It represents the value that
+   * @param {E} value - The "value" parameter is of type E, which means it can be any data type. It represents the value that
    * will be stored in the node of a linked list.
    */
-  constructor(val: E) {
-    this._val = val;
+  constructor(value: E) {
+    this._value = value;
     this._next = null;
   }
 
-  private _val: E;
+  private _value: E;
 
-  get val(): E {
-    return this._val;
+  get value(): E {
+    return this._value;
   }
 
-  set val(value: E) {
-    this._val = value;
+  set value(value: E) {
+    this._value = value;
   }
 
   private _next: SinglyLinkedListNode<E> | null;
@@ -88,12 +88,12 @@ export class SinglyLinkedList<E = any> {
   }
 
   /**
-   * The `push` function adds a new node with the given val to the end of a singly linked list.
-   * @param {E} val - The "val" parameter represents the value that you want to add to the linked list. It can be of
+   * The `push` function adds a new node with the given value to the end of a singly linked list.
+   * @param {E} value - The "value" parameter represents the value that you want to add to the linked list. It can be of
    * any type (E) as specified in the generic type declaration of the class or function.
    */
-  push(val: E): void {
-    const newNode = new SinglyLinkedListNode(val);
+  push(value: E): void {
+    const newNode = new SinglyLinkedListNode(value);
     if (!this.head) {
       this.head = newNode;
       this.tail = newNode;
@@ -105,12 +105,12 @@ export class SinglyLinkedList<E = any> {
   }
 
   /**
-   * The `push` function adds a new node with the given val to the end of a singly linked list.
-   * @param {E} val - The "val" parameter represents the value that you want to add to the linked list. It can be of
+   * The `push` function adds a new node with the given value to the end of a singly linked list.
+   * @param {E} value - The "value" parameter represents the value that you want to add to the linked list. It can be of
    * any type (E) as specified in the generic type declaration of the class or function.
    */
-  addLast(val: E): void {
-    this.push(val);
+  addLast(value: E): void {
+    this.push(value);
   }
 
   /**
@@ -122,22 +122,22 @@ export class SinglyLinkedList<E = any> {
   pop(): E | undefined {
     if (!this.head) return undefined;
     if (this.head === this.tail) {
-      const val = this.head.val;
+      const value = this.head.value;
       this.head = null;
       this.tail = null;
       this._length--;
-      return val;
+      return value;
     }
 
     let current = this.head;
     while (current.next !== this.tail) {
       current = current.next!;
     }
-    const val = this.tail!.val;
+    const value = this.tail!.value;
     current.next = null;
     this.tail = current;
     this._length--;
-    return val;
+    return value;
   }
 
   /**
@@ -159,7 +159,7 @@ export class SinglyLinkedList<E = any> {
     const removedNode = this.head;
     this.head = this.head.next;
     this._length--;
-    return removedNode.val;
+    return removedNode.value;
   }
 
   /**
@@ -172,11 +172,11 @@ export class SinglyLinkedList<E = any> {
 
   /**
    * The unshift function adds a new node with the given value to the beginning of a singly linked list.
-   * @param {E} val - The parameter "val" represents the value of the new node that will be added to the beginning of the
+   * @param {E} value - The parameter "value" represents the value of the new node that will be added to the beginning of the
    * linked list.
    */
-  unshift(val: E): void {
-    const newNode = new SinglyLinkedListNode(val);
+  unshift(value: E): void {
+    const newNode = new SinglyLinkedListNode(value);
     if (!this.head) {
       this.head = newNode;
       this.tail = newNode;
@@ -189,11 +189,11 @@ export class SinglyLinkedList<E = any> {
 
   /**
    * The addFirst function adds a new node with the given value to the beginning of a singly linked list.
-   * @param {E} val - The parameter "val" represents the value of the new node that will be added to the beginning of the
+   * @param {E} value - The parameter "value" represents the value of the new node that will be added to the beginning of the
    * linked list.
    */
-  addFirst(val: E): void {
-    this.unshift(val);
+  addFirst(value: E): void {
+    this.unshift(value);
   }
 
   /**
@@ -209,7 +209,7 @@ export class SinglyLinkedList<E = any> {
     for (let i = 0; i < index; i++) {
       current = current!.next;
     }
-    return current!.val;
+    return current!.value;
   }
 
   /**
@@ -243,7 +243,7 @@ export class SinglyLinkedList<E = any> {
     const removedNode = prevNode!.next;
     prevNode!.next = removedNode!.next;
     this._length--;
-    return removedNode!.val;
+    return removedNode!.value;
   }
 
   /**
@@ -257,7 +257,7 @@ export class SinglyLinkedList<E = any> {
     if (!valueOrNode) return false;
     let value: E;
     if (valueOrNode instanceof SinglyLinkedListNode) {
-      value = valueOrNode.val;
+      value = valueOrNode.value;
     } else {
       value = valueOrNode;
     }
@@ -265,7 +265,7 @@ export class SinglyLinkedList<E = any> {
       prev = null;
 
     while (current) {
-      if (current.val === value) {
+      if (current.value === value) {
         if (prev === null) {
           this.head = current.next;
           if (current === this.tail) {
@@ -291,23 +291,23 @@ export class SinglyLinkedList<E = any> {
    * The `insertAt` function inserts a value at a specified index in a singly linked list.
    * @param {number} index - The index parameter represents the position at which the new value should be inserted in the
    * linked list. It is of type number.
-   * @param {E} val - The `val` parameter represents the value that you want to insert into the linked list at the
+   * @param {E} value - The `value` parameter represents the value that you want to insert into the linked list at the
    * specified index.
    * @returns The `insert` method returns a boolean value. It returns `true` if the insertion is successful, and `false`
    * if the index is out of bounds.
    */
-  insertAt(index: number, val: E): boolean {
+  insertAt(index: number, value: E): boolean {
     if (index < 0 || index > this.length) return false;
     if (index === 0) {
-      this.unshift(val);
+      this.unshift(value);
       return true;
     }
     if (index === this.length) {
-      this.push(val);
+      this.push(value);
       return true;
     }
 
-    const newNode = new SinglyLinkedListNode(val);
+    const newNode = new SinglyLinkedListNode(value);
     const prevNode = this.getNodeAt(index - 1);
     newNode.next = prevNode!.next;
     prevNode!.next = newNode;
@@ -341,7 +341,7 @@ export class SinglyLinkedList<E = any> {
     const array: E[] = [];
     let current = this.head;
     while (current) {
-      array.push(current.val);
+      array.push(current.value);
       current = current.next;
     }
     return array;
@@ -375,11 +375,11 @@ export class SinglyLinkedList<E = any> {
    * @returns The method `find` returns the first element in the linked list that satisfies the condition specified by
    * the callback function. If no element satisfies the condition, it returns `null`.
    */
-  find(callback: (val: E) => boolean): E | null {
+  find(callback: (value: E) => boolean): E | null {
     let current = this.head;
     while (current) {
-      if (callback(current.val)) {
-        return current.val;
+      if (callback(current.value)) {
+        return current.value;
       }
       current = current.next;
     }
@@ -397,7 +397,7 @@ export class SinglyLinkedList<E = any> {
     let current = this.head;
 
     while (current) {
-      if (current.val === value) {
+      if (current.value === value) {
         return index;
       }
       index++;
@@ -418,7 +418,7 @@ export class SinglyLinkedList<E = any> {
     let current = this.head;
 
     while (current) {
-      if (current.val === value) {
+      if (current.value === value) {
         return current;
       }
       current = current.next;
@@ -440,18 +440,18 @@ export class SinglyLinkedList<E = any> {
 
     let existingValue: E;
     if (existingValueOrNode instanceof SinglyLinkedListNode) {
-      existingValue = existingValueOrNode.val;
+      existingValue = existingValueOrNode.value;
     } else {
       existingValue = existingValueOrNode;
     }
-    if (this.head.val === existingValue) {
+    if (this.head.value === existingValue) {
       this.unshift(newValue);
       return true;
     }
 
     let current = this.head;
     while (current.next) {
-      if (current.next.val === existingValue) {
+      if (current.next.value === existingValue) {
         const newNode = new SinglyLinkedListNode(newValue);
         newNode.next = current.next;
         current.next = newNode;
@@ -505,7 +505,7 @@ export class SinglyLinkedList<E = any> {
     let current = this.head;
 
     while (current) {
-      if (current.val === value) {
+      if (current.value === value) {
         count++;
       }
       current = current.next;
@@ -516,15 +516,15 @@ export class SinglyLinkedList<E = any> {
 
   /**
    * The `forEach` function iterates over each element in a linked list and applies a callback function to each element.
-   * @param callback - The callback parameter is a function that takes two arguments: val and index. The val argument
+   * @param callback - The callback parameter is a function that takes two arguments: value and index. The value argument
    * represents the value of the current node in the linked list, and the index argument represents the index of the
    * current node in the linked list.
    */
-  forEach(callback: (val: E, index: number) => void): void {
+  forEach(callback: (value: E, index: number) => void): void {
     let current = this.head;
     let index = 0;
     while (current) {
-      callback(current.val, index);
+      callback(current.value, index);
       current = current.next;
       index++;
     }
@@ -538,11 +538,11 @@ export class SinglyLinkedList<E = any> {
    * SinglyLinkedList).
    * @returns The `map` function is returning a new instance of `SinglyLinkedList<U>` that contains the mapped values.
    */
-  map<U>(callback: (val: E) => U): SinglyLinkedList<U> {
+  map<U>(callback: (value: E) => U): SinglyLinkedList<U> {
     const mappedList = new SinglyLinkedList<U>();
     let current = this.head;
     while (current) {
-      mappedList.push(callback(current.val));
+      mappedList.push(callback(current.value));
       current = current.next;
     }
     return mappedList;
@@ -555,12 +555,12 @@ export class SinglyLinkedList<E = any> {
    * It is used to determine whether a value should be included in the filtered list or not.
    * @returns The filtered list, which is an instance of the SinglyLinkedList class.
    */
-  filter(callback: (val: E) => boolean): SinglyLinkedList<E> {
+  filter(callback: (value: E) => boolean): SinglyLinkedList<E> {
     const filteredList = new SinglyLinkedList<E>();
     let current = this.head;
     while (current) {
-      if (callback(current.val)) {
-        filteredList.push(current.val);
+      if (callback(current.value)) {
+        filteredList.push(current.value);
       }
       current = current.next;
     }
@@ -570,18 +570,18 @@ export class SinglyLinkedList<E = any> {
   /**
    * The `reduce` function iterates over a linked list and applies a callback function to each element, accumulating a
    * single value.
-   * @param callback - The `callback` parameter is a function that takes two arguments: `accumulator` and `val`. It is
+   * @param callback - The `callback` parameter is a function that takes two arguments: `accumulator` and `value`. It is
    * used to perform a specific operation on each element of the linked list.
    * @param {U} initialValue - The `initialValue` parameter is the initial value of the accumulator. It is the starting
    * point for the reduction operation.
    * @returns The `reduce` method is returning the final value of the accumulator after iterating through all the
    * elements in the linked list.
    */
-  reduce<U>(callback: (accumulator: U, val: E) => U, initialValue: U): U {
+  reduce<U>(callback: (accumulator: U, value: E) => U, initialValue: U): U {
     let accumulator = initialValue;
     let current = this.head;
     while (current) {
-      accumulator = callback(accumulator, current.val);
+      accumulator = callback(accumulator, current.value);
       current = current.next;
     }
     return accumulator;
@@ -594,7 +594,7 @@ export class SinglyLinkedList<E = any> {
     let current = this.head;
 
     while (current) {
-      yield current.val;
+      yield current.value;
       current = current.next;
     }
   }

package/src/data-structures/queue/queue.ts

@@ -5,7 +5,7 @@
  */
 import {SinglyLinkedList} from '../linked-list';
 
-export class LinkedListQueue<E = any> extends SinglyLinkedList<E> {
+export class SkipQueue<E = any> extends SinglyLinkedList<E> {
   /**
    * The enqueue function adds a value to the end of an array.
    * @param {E} value - The value parameter represents the value that you want to add to the queue.
@@ -27,7 +27,7 @@ export class LinkedListQueue<E = any> extends SinglyLinkedList<E> {
    * @returns The `peek()` method is returning the value of the `head` node if it exists, otherwise it returns `undefined`.
    */
   peek(): E | undefined {
-    return this.head?.val;
+    return this.head?.value;
   }
 }
 

package/src/interfaces/binary-tree.ts

@@ -2,9 +2,9 @@ import {BinaryTreeNode} from '../data-structures';
 import {BinaryTreeDeletedResult, BTNKey, BinaryTreeNodeNested, BTNCallback} from '../types';
 
 export interface IBinaryTree<V = any, N extends BinaryTreeNode<V, N> = BinaryTreeNodeNested<V>> {
-  createNode(key: BTNKey, val?: N['val']): N;
+  createNode(key: BTNKey, value?: N['value']): N;
 
-  add(keyOrNode: BTNKey | N | null, val?: N['val']): N | null | undefined;
+  add(keyOrNode: BTNKey | N | null, value?: N['value']): N | null | undefined;
 
   delete<C extends BTNCallback<N>>(identifier: ReturnType<C> | null, callback: C): BinaryTreeDeletedResult<N>[];
 }

package/src/interfaces/graph.ts

@@ -1,7 +1,7 @@
 import {VertexKey} from '../types';
 
-export interface IGraph<V, E> {
-  createVertex(key: VertexKey, val?: V): V;
+export interface IGraph<V, E, VO, EO> {
+  createVertex(key: VertexKey, value?: V): VO;
 
-  createEdge(srcOrV1: VertexKey | string, destOrV2: VertexKey | string, weight?: number, val?: E): E;
+  createEdge(srcOrV1: VertexKey, destOrV2: VertexKey, weight?: number, value?: E): EO;
 }

package/test/integration/bst.test.ts

@@ -6,8 +6,8 @@ describe('Individual package BST operations test', () => {
     expect(bst).toBeInstanceOf(BST);
     bst.add(11, 11);
     bst.add(3, 3);
-    const idsOrVals = [15, 1, 8, 13, 16, 2, 6, 9, 12, 14, 4, 7, 10, 5];
-    bst.addMany(idsOrVals, idsOrVals, false);
+    const idsOrValues = [15, 1, 8, 13, 16, 2, 6, 9, 12, 14, 4, 7, 10, 5];
+    bst.addMany(idsOrValues, idsOrValues, false);
     expect(bst.root).toBeInstanceOf(BSTNode);
 
     if (bst.root) expect(bst.root.key).toBe(11);

package/test/unit/data-structures/binary-tree/avl-tree.test.ts

@@ -31,7 +31,7 @@ describe('AVL Tree Test', () => {
     expect(lesserSum).toBe(45);
 
     // node15 has type problem. After the uniform design, the generics of containers (DirectedGraph, BST) are based on the type of value. However, this design has a drawback: when I attempt to inherit from the Vertex or BSTNode classes, the types of the results obtained by all methods are those of the parent class.
-    expect(node15?.val).toBe(15);
+    expect(node15?.value).toBe(15);
 
     const dfs = tree.dfs(node => node, 'in');
     expect(dfs[0].key).toBe(1);
@@ -140,7 +140,7 @@ describe('AVL Tree Test recursively', () => {
     expect(lesserSum).toBe(45);
 
     // node15 has type problem. After the uniform design, the generics of containers (DirectedGraph, BST) are based on the type of value. However, this design has a drawback: when I attempt to inherit from the Vertex or BSTNode classes, the types of the results obtained by all methods are those of the parent class.
-    expect(node15?.val).toBe(15);
+    expect(node15?.value).toBe(15);
 
     const dfs = tree.dfs(node => node, 'in');
     expect(dfs[0].key).toBe(1);

package/test/unit/data-structures/binary-tree/binary-index-tree.test.ts

@@ -297,9 +297,9 @@ describe('', () => {
       }
     }
 
-    update(index: number, val: number): void {
-      this._tree.update(index + 1, val - this._nums[index]);
-      this._nums[index] = val;
+    update(index: number, value: number): void {
+      this._tree.update(index + 1, value - this._nums[index]);
+      this._nums[index] = value;
     }
 
     sumRange(left: number, right: number): number {

package/test/unit/data-structures/binary-tree/binary-tree.test.ts

@@ -20,10 +20,10 @@ describe('BinaryTreeNode', () => {
 
   it('should set and get the value correctly', () => {
     const node: BinaryTreeNode<number> = new BinaryTreeNode<number>(1, 42);
-    expect(node.val).toBe(42);
+    expect(node.value).toBe(42);
 
-    node.val = 55;
-    expect(node.val).toBe(55);
+    node.value = 55;
+    expect(node.value).toBe(55);
   });
 
   it('should set and get the left child correctly', () => {
@@ -110,7 +110,7 @@ describe('BinaryTree', () => {
     const node4 = tree.get(4);
     expect(tree.has(node4)).toBe(false);
     expect(tree.has(node4, node => node)).toBe(false);
-    expect(tree.has('3', node => node.val?.toString())).toBe(true);
+    expect(tree.has('3', node => node.value?.toString())).toBe(true);
   });
 
   it('should getDepth return correct depth', () => {
@@ -343,9 +343,9 @@ describe('BinaryTree', () => {
     const nodeB = tree.get(3);
 
     expect(nodeA?.key).toBe(5);
-    expect(nodeA?.val).toBe('A');
+    expect(nodeA?.value).toBe('A');
     expect(nodeB?.key).toBe(3);
-    expect(nodeB?.val).toBe('B');
+    expect(nodeB?.value).toBe('B');
   });
 
   it('should return null when getting a non-existent node', () => {
@@ -437,14 +437,14 @@ describe('BinaryTree', () => {
     tree.add(3, 'B');
     tree.add(7, 'C');
 
-    const nodes = tree.getNodes('B', (node: BinaryTreeNode<string>) => node.val);
+    const nodes = tree.getNodes('B', (node: BinaryTreeNode<string>) => node.value);
 
     expect(nodes.length).toBe(1);
     expect(nodes[0].key).toBe(3);
 
     const nodesRec = tree.getNodes(
       'B',
-      (node: BinaryTreeNode<string>) => node.val,
+      (node: BinaryTreeNode<string>) => node.value,
       false,
       tree.root,
       IterationType.RECURSIVE

package/test/unit/data-structures/binary-tree/bst.test.ts

@@ -26,7 +26,7 @@ describe('BST operations test', () => {
     const nodeId10 = bst.get(10);
     expect(nodeId10?.key).toBe(10);
 
-    const nodeVal9 = bst.get(9, node => node.val);
+    const nodeVal9 = bst.get(9, node => node.value);
     expect(nodeVal9?.key).toBe(9);
 
     const leftMost = bst.getLeftMost();
@@ -236,7 +236,7 @@ describe('BST operations test', () => {
     expect(leftMost?.key).toBe(1);
 
     const node15 = objBST.get(15);
-    expect(node15?.val).toEqual({key: 15, keyA: 15});
+    expect(node15?.value).toEqual({key: 15, keyA: 15});
     const minNodeBySpecificNode = node15 && objBST.getLeftMost(node15);
     expect(minNodeBySpecificNode?.key).toBe(12);
 
@@ -416,7 +416,7 @@ describe('BST operations test recursively', () => {
     const nodeId10 = bst.get(10);
     expect(nodeId10?.key).toBe(10);
 
-    const nodeVal9 = bst.get(9, node => node.val);
+    const nodeVal9 = bst.get(9, node => node.value);
     expect(nodeVal9?.key).toBe(9);
 
     const leftMost = bst.getLeftMost();
@@ -626,7 +626,7 @@ describe('BST operations test recursively', () => {
     expect(leftMost?.key).toBe(1);
 
     const node15 = objBST.get(15);
-    expect(node15?.val).toEqual({key: 15, keyA: 15});
+    expect(node15?.value).toEqual({key: 15, keyA: 15});
     const minNodeBySpecificNode = node15 && objBST.getLeftMost(node15);
     expect(minNodeBySpecificNode?.key).toBe(12);
 

package/test/unit/data-structures/binary-tree/rb-tree.test.ts

@@ -16,10 +16,10 @@ describe('RBTreeNode', () => {
 
   it('should set and get the value correctly', () => {
     const node: RBTreeNode<number> = new RBTreeNode<number>(1, 42);
-    expect(node.val).toBe(42);
+    expect(node.value).toBe(42);
 
-    node.val = 55;
-    expect(node.val).toBe(55);
+    node.value = 55;
+    expect(node.value).toBe(55);
   });
 
   it('should set and get the left child correctly', () => {

package/test/unit/data-structures/binary-tree/tree-multiset.test.ts

@@ -26,7 +26,7 @@ describe('TreeMultiset operations test', () => {
     const nodeId10 = treeMultiset.get(10);
     expect(nodeId10?.key).toBe(10);
 
-    const nodeVal9 = treeMultiset.get(9, node => node.val);
+    const nodeVal9 = treeMultiset.get(9, node => node.value);
     expect(nodeVal9?.key).toBe(9);
 
     const nodesByCount1 = treeMultiset.getNodes(1, node => node.count);
@@ -266,7 +266,7 @@ describe('TreeMultiset operations test recursively', () => {
     const nodeId10 = treeMultiset.get(10);
     expect(nodeId10?.key).toBe(10);
 
-    const nodeVal9 = treeMultiset.get(9, node => node.val);
+    const nodeVal9 = treeMultiset.get(9, node => node.value);
     expect(nodeVal9?.key).toBe(9);
 
     const nodesByCount1 = treeMultiset.getNodes(1, node => node.count);

package/test/unit/data-structures/graph/abstract-graph.test.ts

@@ -1,5 +1,102 @@
+import {AbstractEdge, AbstractGraph, AbstractVertex, VertexKey} from '../../../../src';
+
+class MyVertex<V = any> extends AbstractVertex<V> {
+  data?: V;
+
+  constructor(key: VertexKey, value?: V) {
+    super(key, value);
+    this.data = value;
+  }
+}
+
+class MyEdge<E = any> extends AbstractEdge<E> {
+  data?: E;
+  src: VertexKey;
+  dest: VertexKey;
+
+  constructor(srcOrV1: VertexKey, destOrV2: VertexKey, weight?: number, value?: E) {
+    super(weight, value);
+    this.src = srcOrV1;
+    this.dest = destOrV2;
+    this.data = value;
+    this._setHashCode('');
+  }
+}
+
+class MyGraph<
+  V = any,
+  E = any,
+  VO extends MyVertex<V> = MyVertex<V>,
+  EO extends MyEdge<E> = MyEdge<E>
+> extends AbstractGraph<V, E, VO, EO> {
+  createVertex(key: VertexKey, value?: V): VO {
+    return new MyVertex(key, value) as VO;
+  }
+
+  createEdge(srcOrV1: VertexKey, destOrV2: VertexKey, weight?: number, value?: E): EO {
+    return new MyEdge(srcOrV1, destOrV2, weight, value) as EO;
+  }
+
+  deleteEdge(edge: EO): EO | null {
+    return edge;
+  }
+
+  getEdge(srcOrKey: VertexKey, destOrKey: VertexKey): EO | null {
+    return new MyEdge(srcOrKey, destOrKey) as EO;
+  }
+
+  degreeOf(vertexOrKey: VO | VertexKey): number {
+    return 1 ?? Number(vertexOrKey);
+  }
+
+  edgeSet(): EO[] {
+    return [new MyEdge('a', 'b') as EO];
+  }
+
+  edgesOf(vertexOrKey: VO | VertexKey): EO[] {
+    const a = typeof vertexOrKey === "string" ? vertexOrKey : "a";
+    return [new MyEdge(a, 'b') as EO];
+  }
+
+  getNeighbors(vertexOrKey: VO | VertexKey): VO[] {
+    const a = typeof vertexOrKey === "string" ? vertexOrKey : "a";
+    return [new MyVertex(a, 'b') as VO];
+  }
+
+  getEndsOfEdge(edge: EO): [VO, VO] | null {
+    return edge ? null : null;
+  }
+
+  protected _addEdgeOnly(edge: EO): boolean {
+    return edge ? true : true;
+  }
+}
+
 describe('AbstractGraph Operation Test', () => {
-  it('should xxx', function () {
-    expect(true).toBe(true);
+  const myGraph: MyGraph<number, string> = new MyGraph<number, string>();
+
+  beforeEach(() => {
+  });
+  it('should edge cases', function () {
+    myGraph.addVertex('A', 1);
+    myGraph.addVertex('B', 2);
+    myGraph.addVertex('C', 3);
+    myGraph.addVertex('D', 4);
+
+    const vA = myGraph.getVertex('A');
+    // const vB = myGraph.getVertex('B');
+    // const vC = myGraph.getVertex('C');
+    // const vD = myGraph.getVertex('D');
+
+    const eAB = new MyEdge('A', 'B');
+    // const eBC = new MyEdge('B', 'C');
+    // const eCD = new MyEdge('C', 'D');
+    vA!.key = vA?.key || 1;
+    vA!.value = vA?.value ?? 2;
+
+    eAB!.value = eAB.value;
+    const hs = eAB.hashCode;
+
+    expect(hs).toBe('');
   });
 });