Add karger min cut test

Author: LyangHiga

src/data-structures/basics/linkedList.ts

@@ -163,4 +163,4 @@ class LinkedList<T> {
   };
 }
 
-export = LinkedList;
+export default LinkedList;

src/data-structures/basics/llNode.ts

@@ -6,4 +6,4 @@ class LLNode<T> {
   }
 }
 
-export = LLNode;
+export default LLNode;

src/data-structures/basics/node.ts

@@ -6,4 +6,4 @@ class Node {
   }
 }
 
-export = Node;
+export default Node;

src/data-structures/basics/queue.ts

@@ -41,4 +41,4 @@ class Queue {
   }
 }
 
-export = Queue;
+export default Queue;

src/data-structures/basics/stack.ts

@@ -43,4 +43,4 @@ class Stack {
   }
 }
 
-export = Stack;
+export default Stack;

src/data-structures/disjoint-sets/forestNode.ts

@@ -7,4 +7,4 @@ class ForestNode<T> {
   }
 }
 
-export = ForestNode;
+export default ForestNode;

src/data-structures/disjoint-sets/forestSet.ts

@@ -38,4 +38,4 @@ class ForestSet<T> {
   };
 }
 
-export = ForestSet;
+export default ForestSet;

src/data-structures/disjoint-sets/listSet.ts

@@ -66,4 +66,4 @@ class ListSet<T> {
   };
 }
 
-export = ListSet;
+export default ListSet;

src/data-structures/graph/graph.test.ts

@@ -0,0 +1,32 @@
+import { getTestAnswer } from "../../helperTests";
+import Graph from "./graph";
+
+describe("Graph class test", () => {
+  //TODO: Add tests for helpers
+
+  test("Kargen Min Cut Test", () => {
+    const TEST_28 = "random_28_125.txt";
+    const TEST_32 = "random_32_150.txt";
+    const TEST_36 = "random_36_175.txt";
+    const TEST_40 = "random_40_200.txt";
+
+    const test = (n: number, file: string) => {
+      let min = Infinity;
+      for (let i = 0; i < n; i++) {
+        const g = Graph.createListAdj(
+          `${__dirname}/test-datasets/kargen-min-cut/input_${file}`
+        );
+        min = Math.min(min, g.kargerMinCut());
+      }
+      const ans = getTestAnswer(
+        `${__dirname}/test-datasets/kargen-min-cut/output_${file}`
+      );
+      expect(min).toBe(ans);
+    };
+
+    test(600, TEST_28);
+    test(600, TEST_32);
+    test(700, TEST_36);
+    test(700, TEST_40);
+  });
+});

src/data-structures/graph/graph.ts

@@ -7,7 +7,7 @@ import BHNode from "../heaps/bHNode";
 // import FHNode from "./heaps/fHNode";
 import ListSet from "../disjoint-sets/listSet";
 import ForestSet from "../disjoint-sets/forestSet";
-import fs from "fs";
+import * as fs from "fs";
 import Vertex from "./vertex";
 
 // Returns a random number between [min,max)
@@ -65,6 +65,7 @@ class Graph<T> {
     return false;
   };
 
+  // FOR karge min cut
   // Returns how many edges are between verteces u and v
   hme = (u: T, v: T) => {
     if (!this.contains(u)) return false;
@@ -76,6 +77,7 @@ class Graph<T> {
     return c;
   };
 
+  // FOR karge min cut
   // Returns the number of edges of this graph
   countEdges = () => {
     let c = 0;
@@ -87,6 +89,7 @@ class Graph<T> {
     return c / 2;
   };
 
+  // FOR karge min cut
   // Returns the key of two neighbours [u,v]
   pickRandomEdge = () => {
     const keys = [...this.list.keys()];
@@ -98,6 +101,7 @@ class Graph<T> {
     return [u, v];
   };
 
+  // FOR karge min cut
   // Merge two verteces into a single one
   mergeVerteces = (u: T, v: T) => {
     // adds all neighbours of v to u
@@ -1099,4 +1103,4 @@ class Graph<T> {
   };
 }
 
-export = Graph;
+export default Graph;