data-structure-typed 1.52.0 → 1.52.1

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

@@ -995,3 +995,31 @@ describe('DirectedGraph tarjan', () => {
     expect(getAsVerticesArrays(sccs)).toEqual([['K', 'J', 'I', 'H', 'D', 'C', 'B'], ['G', 'F', 'E'], ['A']]);
   });
 });
+
+describe('delete', () => {
+  it(`deleteVertex deletes all of it's neighbors from the inEdge Map`, () => {
+
+    const graph = new DirectedGraph();
+    graph.addVertex('A');
+    graph.addVertex('B');
+    graph.addVertex('C');
+
+    graph.addEdge('B', 'A');
+    graph.addEdge('C', 'A');
+
+    // 'Incoming to A should contain ['B','C']
+    expect(graph.incomingEdgesOf('A').map((e) => e.src)).toEqual(['B','C']); //  ['B','C']
+
+    // Now delete B, which has no direct link to C, only that C -> A.
+    graph.deleteVertex('B');
+
+    // Now if we do the same call to incoming edges for we should get only ['C']
+    expect(graph.incomingEdgesOf('A').map((e) => e.src)).toEqual(['C']); // [];
+
+    // but it only shows an empty array, since we deleted all of `A's edges, not just the one to `B`.
+
+    // If we check C, it correctly shows A as an outgoing edge,
+    // even though A no longer has any knowledge of C linking to it.
+    expect(graph.outgoingEdgesOf('C').map((e) => e.dest)).toEqual(['A']);
+  });
+})

package/test/unit/data-structures/heap/heap.test.ts

@@ -2,6 +2,26 @@ import { FibonacciHeap, Heap, MaxHeap, MinHeap } from '../../../../src';
 import { logBigOMetricsWrap } from '../../../utils';
 
 describe('Heap Operation Test', () => {
+
+  it('should heap add and delete work well', function () {
+    const hp = new MinHeap<number>();
+
+    hp.add(2);
+    hp.add(3);
+    hp.add(1);
+    hp.add(4);
+    hp.add(6);
+    hp.add(5);
+    hp.add(7);
+
+    hp.delete(4);
+    hp.delete(7);
+    hp.delete(1);
+
+    expect(hp.size).toBe(4);
+    expect(hp.peek()).toBe(2);
+  });
+
   it('should numeric heap work well', function () {
     const minNumHeap = new MinHeap<number>();
     minNumHeap.add(1);

package/test/unit/data-structures/queue/deque.test.ts

@@ -260,6 +260,25 @@ describe('Deque - Utility Operations', () => {
     // deque.print();
     // expect(consoleSpy).toHaveBeenCalledWith([1, 2]);
   });
+
+  test('should maxLen work well', () => {
+    const dequeMaxLen = new Deque([3, 4, 5, 6, 7], { maxLen: 3 });
+    expect(dequeMaxLen.size).toBe(3);
+    expect(dequeMaxLen.toArray()).toEqual([5, 6 ,7]);
+    dequeMaxLen.unshift(4);
+    dequeMaxLen.unshift(3);
+    expect(dequeMaxLen.size).toBe(3);
+    expect(dequeMaxLen.toArray()).toEqual([3, 4, 5]);
+
+    const dequeNoMaxLen = new Deque([3, 4, 5, 6, 7]);
+    expect(dequeNoMaxLen.size).toBe(5);
+    expect(dequeNoMaxLen.toArray()).toEqual([3, 4, 5, 6, 7]);
+    dequeNoMaxLen.unshift(4);
+    dequeNoMaxLen.unshift(3);
+    expect(dequeNoMaxLen.size).toBe(7);
+    expect(dequeNoMaxLen.toArray()).toEqual([3, 4, 3, 4, 5, 6, 7]);
+
+  });
 });
 
 describe('Deque - Additional Operations', () => {