data-structure-typed 1.48.3 → 1.48.5

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

@@ -17,7 +17,7 @@ describe('UndirectedGraph Operation Test', () => {
     expect(graph.getEndsOfEdge(new UndirectedEdge('c', 'd'))).toBe(undefined);
   });
 
-  it('should add vertices', () => {
+  it('should add vertexMap', () => {
     const vertex1 = new UndirectedVertex('A');
     const vertex2 = new UndirectedVertex('B');
 
@@ -76,8 +76,8 @@ describe('UndirectedGraph', () => {
     undirectedGraph = new UndirectedGraph<string, string>();
   });
 
-  // Test adding vertices to the graph
-  it('should add vertices to the graph', () => {
+  // Test adding vertexMap to the graph
+  it('should add vertexMap to the graph', () => {
     const vertexA = new UndirectedVertex('A', 'Location A');
     const vertexB = new UndirectedVertex('B', 'Location B');
 
@@ -130,8 +130,8 @@ describe('UndirectedGraph', () => {
     const edgeAB = new UndirectedEdge('A', 'B', 3, 'Edge between A and B');
     const edgeBC = new UndirectedEdge('B', 'C', 4, 'Edge between B and C');
 
-    edgeAB.vertices = edgeAB.vertices;
-    expect(undirectedGraph.edges.size).toBe(0);
+    edgeAB.vertexMap = edgeAB.vertexMap;
+    expect(undirectedGraph.edgeMap.size).toBe(0);
     undirectedGraph.addVertex(vertexA);
     undirectedGraph.addVertex(vertexB);
     undirectedGraph.addVertex(vertexC);
@@ -173,6 +173,43 @@ describe('UndirectedGraph', () => {
     expect(minWeightedPath?.minPath?.[3]?.key).toBe('Intersection_4');
     expect(minWeightedPath?.minPath?.[4]?.key).toBe('Intersection_5');
   });
+
+  test('Removing an edge of a UndirectedGraph should not delete additional edges', () => {
+    const dg = new UndirectedGraph();
+    dg.addVertex('hello')
+    dg.addVertex('hi')
+    dg.addVertex('hey')
+    dg.addEdge('hello', 'hi')
+    dg.addEdge('hello', 'hey')
+    expect(dg.getEdge('hello', 'hi')?.vertexMap[0]).toBe('hello')
+    expect(dg.getEdge('hello', 'hi')?.vertexMap[1]).toBe('hi')
+    expect(dg.getEdge('hello', 'hey')?.vertexMap[0]).toBe('hello')
+    expect(dg.getEdge('hello', 'hey')?.vertexMap[1]).toBe('hey')
+    dg.deleteEdge('hello', 'hi')
+    expect(dg.getEdge('hello', 'hi')).toBe(undefined)
+    expect(dg.getEdge('hello', 'hey')).toBeInstanceOf(UndirectedEdge)
+  });
+
+  test('Removing a vertex from a UndirectedGraph should remove its edges', () => {
+    const dg = new UndirectedGraph();
+    dg.addVertex('hello')
+    dg.addVertex('world')
+    dg.addVertex('earth')
+
+    dg.addEdge('hello', 'world')
+    dg.addEdge('hello', 'earth')
+    dg.addEdge('world', 'earth')
+
+    expect(dg.getEdge('hello', 'world')?.vertexMap[0]).toBe('hello');
+    expect(dg.edgeSet().length).toBe(3)
+    expect(dg.edgeSet()[0].vertexMap).toEqual(['hello', 'world'])
+
+    dg.deleteVertex('hello')
+    expect(dg.edgeSet().length).toBe(1)
+    expect(dg.edgeSet()?.[0].vertexMap[0]).toBe('world')
+
+    expect(dg.getEdge('hello', 'world')).toBe(undefined);
+  })
 });
 
 describe('cycles, strongly connected components, bridges, articular points in UndirectedGraph', () => {