Use require instead of import in js

64json · 64json · commit 9a48744c5537 · 2019-02-04T20:32:03.000-05:00
diff --git a/.gitignore b/.gitignore
@@ -1,2 +1,6 @@
-.idea
+/.idea
+/node_modules
+/npm-debug.log
+/package.json
+/package-lock.json
 .DS_Store
diff --git a/Backtracking/Knight's Tour Problem/code.js b/Backtracking/Knight's Tour Problem/code.js
@@ -1,4 +1,4 @@
-import { Array1DTracer, Array2DTracer, LogTracer } from 'algorithm-visualizer';
+const { Array1DTracer, Array2DTracer, LogTracer } = require('algorithm-visualizer');
 
 /*
 For N>3 the time taken by this algorithm is sufficiently high
diff --git a/Backtracking/N-Queens Problem/code.js b/Backtracking/N-Queens Problem/code.js
@@ -1,4 +1,4 @@
-import { Array2DTracer, LogTracer } from 'algorithm-visualizer';
+const { Array2DTracer, LogTracer } = require('algorithm-visualizer');
 
 const N = 4; // just change the value of N and the visuals will reflect the configuration!
 const board = (function createArray(N) {
diff --git a/Branch and Bound/Binary Search Tree/insertion.js b/Branch and Bound/Binary Search Tree/insertion.js
@@ -1,4 +1,4 @@
-import { Array1DTracer, GraphTracer, LogTracer } from 'algorithm-visualizer';
+const { Array1DTracer, GraphTracer, LogTracer } = require('algorithm-visualizer');
 
 const T = {};
 
diff --git a/Branch and Bound/Binary Search Tree/search.js b/Branch and Bound/Binary Search Tree/search.js
@@ -1,4 +1,4 @@
-import { GraphTracer, LogTracer, Randomize } from 'algorithm-visualizer';
+const { GraphTracer, LogTracer, Randomize } = require('algorithm-visualizer');
 
 const G = [ // G[i][j] indicates whether the path from the i-th node to the j-th node exists or not
   [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],
diff --git a/Branch and Bound/Binary Search/iterative.js b/Branch and Bound/Binary Search/iterative.js
@@ -1,4 +1,4 @@
-import { Array1DTracer, ChartTracer, LogTracer, Randomize } from 'algorithm-visualizer';
+const { Array1DTracer, ChartTracer, LogTracer, Randomize } = require('algorithm-visualizer');
 
 const chart = new ChartTracer();
 const tracer = new Array1DTracer().chart(chart);
diff --git a/Branch and Bound/Binary Search/recursive.js b/Branch and Bound/Binary Search/recursive.js
@@ -1,4 +1,4 @@
-import { Array1DTracer, ChartTracer, LogTracer, Randomize } from 'algorithm-visualizer';
+const { Array1DTracer, ChartTracer, LogTracer, Randomize } = require('algorithm-visualizer');
 
 const chart = new ChartTracer();
 const tracer = new Array1DTracer().chart(chart);
diff --git a/Branch and Bound/Depth-Limited Search/code.js b/Branch and Bound/Depth-Limited Search/code.js
@@ -1,4 +1,4 @@
-import { GraphTracer, LogTracer } from 'algorithm-visualizer';
+const { GraphTracer, LogTracer } = require('algorithm-visualizer');
 
 const tracer = new GraphTracer();
 const logger = new LogTracer();
diff --git a/Branch and Bound/Topological Sort/code.js b/Branch and Bound/Topological Sort/code.js
@@ -1,4 +1,4 @@
-import { GraphTracer, LogTracer } from 'algorithm-visualizer';
+const { GraphTracer, LogTracer } = require('algorithm-visualizer');
 
 const tracer = new GraphTracer();
 const logger = new LogTracer();
diff --git a/Brute Force/Binary Tree Traversal/inOrder.js b/Brute Force/Binary Tree Traversal/inOrder.js
@@ -1,4 +1,4 @@
-import { Array1DTracer, GraphTracer, LogTracer } from 'algorithm-visualizer';
+const { Array1DTracer, GraphTracer, LogTracer } = require('algorithm-visualizer');
 
 const G = [ // G[i][j] indicates whether the path from the i-th node to the j-th node exists or not
   [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],
diff --git a/Brute Force/Binary Tree Traversal/postOrder.js b/Brute Force/Binary Tree Traversal/postOrder.js
@@ -1,4 +1,4 @@
-import { Array1DTracer, GraphTracer, LogTracer } from 'algorithm-visualizer';
+const { Array1DTracer, GraphTracer, LogTracer } = require('algorithm-visualizer');
 
 const G = [ // G[i][j] indicates whether the path from the i-th node to the j-th node exists or not
   [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],
diff --git a/Brute Force/Binary Tree Traversal/preOrder.js b/Brute Force/Binary Tree Traversal/preOrder.js
@@ -1,4 +1,4 @@
-import { Array1DTracer, GraphTracer, LogTracer } from 'algorithm-visualizer';
+const { Array1DTracer, GraphTracer, LogTracer } = require('algorithm-visualizer');
 
 const G = [ // G[i][j] indicates whether the path from the i-th node to the j-th node exists or not
   [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],
diff --git a/Brute Force/Bipartiteness Test/code.js b/Brute Force/Bipartiteness Test/code.js
@@ -1,4 +1,4 @@
-import { Array1DTracer, GraphTracer, LogTracer } from 'algorithm-visualizer';
+const { Array1DTracer, GraphTracer, LogTracer } = require('algorithm-visualizer');
 
 const tracer = new GraphTracer().directed(false);
 const logger = new LogTracer();
diff --git a/Brute Force/Breadth-First Search/shortestPath.js b/Brute Force/Breadth-First Search/shortestPath.js
@@ -1,4 +1,4 @@
-import { GraphTracer, LogTracer, Randomize } from 'algorithm-visualizer';
+const { GraphTracer, LogTracer, Randomize } = require('algorithm-visualizer');
 
 const tracer = new GraphTracer().directed(false).weighted();
 const logger = new LogTracer();
diff --git a/Brute Force/Breadth-First Search/tree.js b/Brute Force/Breadth-First Search/tree.js
@@ -1,4 +1,4 @@
-import { GraphTracer, LogTracer } from 'algorithm-visualizer';
+const { GraphTracer, LogTracer } = require('algorithm-visualizer');
 
 const tracer = new GraphTracer().log(new LogTracer());
 const G = [ // G[i][j] indicates whether the path from the i-th node to the j-th node exists or not
diff --git a/Brute Force/Bridge Finding/efficient.js b/Brute Force/Bridge Finding/efficient.js
@@ -1,4 +1,4 @@
-import { GraphTracer, LogTracer } from 'algorithm-visualizer';
+const { GraphTracer, LogTracer } = require('algorithm-visualizer');
 
 const graphTracer = new GraphTracer().directed(false);
 const logger = new LogTracer();
diff --git a/Brute Force/Bridge Finding/naive.js b/Brute Force/Bridge Finding/naive.js
@@ -1,4 +1,4 @@
-import { GraphTracer, LogTracer } from 'algorithm-visualizer';
+const { GraphTracer, LogTracer } = require('algorithm-visualizer');
 
 const tracer = new GraphTracer().directed(false);
 const logger = new LogTracer();
diff --git a/Brute Force/Bubble Sort/code.js b/Brute Force/Bubble Sort/code.js
@@ -1,4 +1,4 @@
-import { Array1DTracer, ChartTracer, LogTracer, Randomize } from 'algorithm-visualizer';
+const { Array1DTracer, ChartTracer, LogTracer, Randomize } = require('algorithm-visualizer');
 
 const chart = new ChartTracer();
 const tracer = new Array1DTracer().chart(chart);
diff --git a/Brute Force/Comb Sort/code.js b/Brute Force/Comb Sort/code.js
@@ -1,4 +1,4 @@
-import { Array1DTracer, ChartTracer, LogTracer, Randomize } from 'algorithm-visualizer';
+const { Array1DTracer, ChartTracer, LogTracer, Randomize } = require('algorithm-visualizer');
 
 const chart = new ChartTracer();
 const tracer = new Array1DTracer().chart(chart);
diff --git a/Brute Force/Cycle Sort/code.js b/Brute Force/Cycle Sort/code.js
@@ -1,4 +1,4 @@
-import { Array1DTracer, ChartTracer, LogTracer, Randomize } from 'algorithm-visualizer';
+const { Array1DTracer, ChartTracer, LogTracer, Randomize } = require('algorithm-visualizer');
 
 const chart = new ChartTracer();
 const tracer = new Array1DTracer().chart(chart);
diff --git a/Brute Force/Depth-First Search/graph.js b/Brute Force/Depth-First Search/graph.js
@@ -1,4 +1,4 @@
-import { Array1DTracer, GraphTracer, LogTracer, Randomize } from 'algorithm-visualizer';
+const { Array1DTracer, GraphTracer, LogTracer, Randomize } = require('algorithm-visualizer');
 
 const graphTracer = new GraphTracer().directed(false);
 const visitedTracer = new Array1DTracer('visited');
diff --git a/Brute Force/Depth-First Search/shortestPath.js b/Brute Force/Depth-First Search/shortestPath.js
@@ -1,4 +1,4 @@
-import { GraphTracer, LogTracer, Randomize } from 'algorithm-visualizer';
+const { GraphTracer, LogTracer, Randomize } = require('algorithm-visualizer');
 
 const tracer = new GraphTracer().directed(false).weighted();
 const logger = new LogTracer();
diff --git a/Brute Force/Depth-First Search/tree.js b/Brute Force/Depth-First Search/tree.js
@@ -1,4 +1,4 @@
-import { GraphTracer, LogTracer } from 'algorithm-visualizer';
+const { GraphTracer, LogTracer } = require('algorithm-visualizer');
 
 const tracer = new GraphTracer().log(new LogTracer());
 const G = [ // G[i][j] indicates whether the path from the i-th node to the j-th node exists or not
diff --git a/Brute Force/Depth-First Search/weightedGraph.js b/Brute Force/Depth-First Search/weightedGraph.js
@@ -1,4 +1,4 @@
-import { GraphTracer, LogTracer, Randomize } from 'algorithm-visualizer';
+const { GraphTracer, LogTracer, Randomize } = require('algorithm-visualizer');
 
 const tracer = new GraphTracer().directed(false).weighted();
 const logger = new LogTracer();
diff --git a/Brute Force/Flood Fill/code.js b/Brute Force/Flood Fill/code.js
@@ -1,4 +1,4 @@
-import { Array2DTracer } from 'algorithm-visualizer';
+const { Array2DTracer } = require('algorithm-visualizer');
 
 const tracer = new Array2DTracer();
 const G = [
diff --git a/Brute Force/Heapsort/code.js b/Brute Force/Heapsort/code.js
@@ -1,4 +1,4 @@
-import { Array1DTracer, ChartTracer, LogTracer, Randomize } from 'algorithm-visualizer';
+const { Array1DTracer, ChartTracer, LogTracer, Randomize } = require('algorithm-visualizer');
 
 const chart = new ChartTracer();
 const tracer = new Array1DTracer().chart(chart);
diff --git a/Brute Force/Insertion Sort/code.js b/Brute Force/Insertion Sort/code.js
@@ -1,4 +1,4 @@
-import { Array1DTracer, ChartTracer, LogTracer, Randomize } from 'algorithm-visualizer';
+const { Array1DTracer, ChartTracer, LogTracer, Randomize } = require('algorithm-visualizer');
 
 const chart = new ChartTracer();
 const tracer = new Array1DTracer().chart(chart);
diff --git a/Brute Force/Lowest Common Ancestor/code.js b/Brute Force/Lowest Common Ancestor/code.js
@@ -1,4 +1,4 @@
-import { GraphTracer, LogTracer } from 'algorithm-visualizer';
+const { GraphTracer, LogTracer } = require('algorithm-visualizer');
 
 const G = [ // G[i][j] indicates whether the path from the i-th node to the j-th node exists or not
   [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],
diff --git a/Brute Force/PageRank/code.js b/Brute Force/PageRank/code.js
@@ -1,4 +1,4 @@
-import { Array1DTracer, Array2DTracer, GraphTracer, LogTracer, Randomize } from 'algorithm-visualizer';
+const { Array1DTracer, Array2DTracer, GraphTracer, LogTracer, Randomize } = require('algorithm-visualizer');
 
 function filledArray(length, value) {
   return Array(...Array(length)).map(Number.prototype.valueOf, value);
diff --git a/Brute Force/Pancake Sort/code.js b/Brute Force/Pancake Sort/code.js
@@ -1,4 +1,4 @@
-import { Array1DTracer, ChartTracer, LogTracer, Randomize } from 'algorithm-visualizer';
+const { Array1DTracer, ChartTracer, LogTracer, Randomize } = require('algorithm-visualizer');
 
 const chart = new ChartTracer();
 const tracer = new Array1DTracer().chart(chart);
diff --git a/Brute Force/Rabin-Karp's String Search/code.js b/Brute Force/Rabin-Karp's String Search/code.js
@@ -1,4 +1,4 @@
-import { Array1DTracer, LogTracer } from 'algorithm-visualizer';
+const { Array1DTracer, LogTracer } = require('algorithm-visualizer');
 
 const text = ['h', 'e', 'l', 'l', 'o', ' ', 's', 'i', 'r', ' ', 'h', 'e', 'l', 'l', 'o'];
 const pattern = ['h', 'e', 'l', 'l', 'o'];
diff --git a/Brute Force/Selection Sort/code.js b/Brute Force/Selection Sort/code.js
@@ -1,4 +1,4 @@
-import { Array1DTracer, ChartTracer, LogTracer, Randomize } from 'algorithm-visualizer';
+const { Array1DTracer, ChartTracer, LogTracer, Randomize } = require('algorithm-visualizer');
 
 const chart = new ChartTracer();
 const tracer = new Array1DTracer().chart(chart);
diff --git a/Brute Force/Shellsort/code.js b/Brute Force/Shellsort/code.js
@@ -1,4 +1,4 @@
-import { Array1DTracer, ChartTracer, LogTracer, Randomize } from 'algorithm-visualizer';
+const { Array1DTracer, ChartTracer, LogTracer, Randomize } = require('algorithm-visualizer');
 
 const chart = new ChartTracer();
 const tracer = new Array1DTracer().chart(chart);
diff --git a/Brute Force/Tarjan's Strongly Connected Components/code.js b/Brute Force/Tarjan's Strongly Connected Components/code.js
@@ -1,4 +1,4 @@
-import { Array1DTracer, GraphTracer, LogTracer } from 'algorithm-visualizer';
+const { Array1DTracer, GraphTracer, LogTracer } = require('algorithm-visualizer');
 
 const G = [
   [0, 0, 1, 1, 0, 0],
diff --git a/Divide and Conquer/Bucket Sort/code.js b/Divide and Conquer/Bucket Sort/code.js
@@ -1,4 +1,4 @@
-import { Array2DTracer, Randomize } from 'algorithm-visualizer';
+const { Array2DTracer, Randomize } = require('algorithm-visualizer');
 
 const maxValue = 100;
 const arraySize = 10;
diff --git a/Divide and Conquer/Counting Sort/code.js b/Divide and Conquer/Counting Sort/code.js
@@ -1,4 +1,4 @@
-import { Array2DTracer, Randomize } from 'algorithm-visualizer';
+const { Array2DTracer, Randomize } = require('algorithm-visualizer');
 
 const maxValue = 9;
 const arrSize = 10;
diff --git a/Divide and Conquer/Merge Sort/bottomUp.js b/Divide and Conquer/Merge Sort/bottomUp.js
@@ -1,4 +1,4 @@
-import { Array2DTracer, LogTracer, Randomize } from 'algorithm-visualizer';
+const { Array2DTracer, LogTracer, Randomize } = require('algorithm-visualizer');
 
 const tracer = new Array2DTracer();
 const logger = new LogTracer();
diff --git a/Divide and Conquer/Merge Sort/topDown.js b/Divide and Conquer/Merge Sort/topDown.js
@@ -1,4 +1,4 @@
-import { Array1DTracer, ChartTracer, LogTracer, Randomize } from 'algorithm-visualizer';
+const { Array1DTracer, ChartTracer, LogTracer, Randomize } = require('algorithm-visualizer');
 
 const chart = new ChartTracer();
 const tracer = new Array1DTracer().chart(chart);
diff --git a/Divide and Conquer/Pigeonhole Sort/code.js b/Divide and Conquer/Pigeonhole Sort/code.js
@@ -1,4 +1,4 @@
-import { Array1DTracer, Array2DTracer, LogTracer, Randomize } from 'algorithm-visualizer';
+const { Array1DTracer, Array2DTracer, LogTracer, Randomize } = require('algorithm-visualizer');
 
 const A = new Randomize.Array1D(7).create();
 const N = A.length;
diff --git a/Divide and Conquer/Quicksort/code.js b/Divide and Conquer/Quicksort/code.js
@@ -1,4 +1,4 @@
-import { Array1DTracer, ChartTracer, LogTracer, Randomize } from 'algorithm-visualizer';
+const { Array1DTracer, ChartTracer, LogTracer, Randomize } = require('algorithm-visualizer');
 
 const chart = new ChartTracer();
 const tracer = new Array1DTracer().chart(chart);
diff --git a/Divide and Conquer/Radix Sort/leastSignificantDigit.js b/Divide and Conquer/Radix Sort/leastSignificantDigit.js
@@ -1,4 +1,4 @@
-import { Array2DTracer, LogTracer, Randomize } from 'algorithm-visualizer';
+const { Array2DTracer, LogTracer, Randomize } = require('algorithm-visualizer');
 
 const tracer = new Array2DTracer();
 const logger = new LogTracer();
diff --git a/Dynamic Programming/Bellman-Ford's Shortest Path/code.js b/Dynamic Programming/Bellman-Ford's Shortest Path/code.js
@@ -1,4 +1,4 @@
-import { GraphTracer, LogTracer, Randomize } from 'algorithm-visualizer';
+const { GraphTracer, LogTracer, Randomize } = require('algorithm-visualizer');
 
 const tracer = new GraphTracer().weighted();
 const logger = new LogTracer();
diff --git a/Dynamic Programming/Catalan Number/code.js b/Dynamic Programming/Catalan Number/code.js
@@ -1,4 +1,4 @@
-import { Array1DTracer, LogTracer } from 'algorithm-visualizer';
+const { Array1DTracer, LogTracer } = require('algorithm-visualizer');
 
 const N = 10;
 const A = new Array(N + 1);
diff --git a/Dynamic Programming/Fibonacci Sequence/code.js b/Dynamic Programming/Fibonacci Sequence/code.js
@@ -1,4 +1,4 @@
-import { Array1DTracer } from 'algorithm-visualizer';
+const { Array1DTracer } = require('algorithm-visualizer');
 
 const tracer = new Array1DTracer('Sequence');
 const index = 15;
diff --git a/Dynamic Programming/Floyd-Warshall's Shortest Path/code.js b/Dynamic Programming/Floyd-Warshall's Shortest Path/code.js
@@ -1,4 +1,4 @@
-import { GraphTracer, LogTracer, Randomize } from 'algorithm-visualizer';
+const { GraphTracer, LogTracer, Randomize } = require('algorithm-visualizer');
 
 const tracer = new GraphTracer().weighted();
 const logger = new LogTracer();
diff --git a/Dynamic Programming/Integer Partition/code.js b/Dynamic Programming/Integer Partition/code.js
@@ -1,4 +1,4 @@
-import { Array2DTracer, LogTracer, Randomize } from 'algorithm-visualizer';
+const { Array2DTracer, LogTracer, Randomize } = require('algorithm-visualizer');
 
 const tracer = new Array2DTracer();
 const logger = new LogTracer();
diff --git a/Dynamic Programming/Knapsack Problem/code.js b/Dynamic Programming/Knapsack Problem/code.js
@@ -1,4 +1,4 @@
-import { Array1DTracer, Array2DTracer, LogTracer } from 'algorithm-visualizer';
+const { Array1DTracer, Array2DTracer, LogTracer } = require('algorithm-visualizer');
 
 const val = [1, 4, 5, 7]; // The value of all available items
 const wt = [1, 3, 4, 5]; // The weights of available items
diff --git a/Dynamic Programming/Knuth-Morris-Pratt's String Search/code.js b/Dynamic Programming/Knuth-Morris-Pratt's String Search/code.js
@@ -1,4 +1,4 @@
-import { Array1DTracer, LogTracer } from 'algorithm-visualizer';
+const { Array1DTracer, LogTracer } = require('algorithm-visualizer');
 
 function randString(length) {
   const result = Math.random().toString(36);
diff --git a/Dynamic Programming/Levenshtein's Edit Distance/code.js b/Dynamic Programming/Levenshtein's Edit Distance/code.js
@@ -1,4 +1,4 @@
-import { Array2DTracer, LogTracer } from 'algorithm-visualizer';
+const { Array2DTracer, LogTracer } = require('algorithm-visualizer');
 
 const tracer = new Array2DTracer('Distance Table');
 const logger = new LogTracer();
diff --git a/Dynamic Programming/Longest Common Subsequence/code.js b/Dynamic Programming/Longest Common Subsequence/code.js
@@ -1,4 +1,4 @@
-import { Array1DTracer, Array2DTracer, LogTracer } from 'algorithm-visualizer';
+const { Array1DTracer, Array2DTracer, LogTracer } = require('algorithm-visualizer');
 
 const string1 = 'AGGTAB';
 const string2 = 'GXTXAYB';
diff --git a/Dynamic Programming/Longest Increasing Subsequence/code.js b/Dynamic Programming/Longest Increasing Subsequence/code.js
@@ -1,4 +1,4 @@
-import { Array1DTracer, LogTracer, Randomize } from 'algorithm-visualizer';
+const { Array1DTracer, LogTracer, Randomize } = require('algorithm-visualizer');
 
 const tracer = new Array1DTracer();
 const logger = new LogTracer();
diff --git a/Dynamic Programming/Longest Palindromic Subsequence/code.js b/Dynamic Programming/Longest Palindromic Subsequence/code.js
@@ -1,4 +1,4 @@
-import { Array1DTracer, Array2DTracer, LogTracer } from 'algorithm-visualizer';
+const { Array1DTracer, Array2DTracer, LogTracer } = require('algorithm-visualizer');
 
 const tracer = new Array1DTracer('Input Text');
 const matrix = new Array2DTracer('Matrix');
diff --git a/Dynamic Programming/Maximum Subarray/code.js b/Dynamic Programming/Maximum Subarray/code.js
@@ -1,4 +1,4 @@
-import { Array1DTracer, LogTracer } from 'algorithm-visualizer';
+const { Array1DTracer, LogTracer } = require('algorithm-visualizer');
 
 const tracer = new Array1DTracer();
 const logger = new LogTracer();
diff --git a/Dynamic Programming/Maximum Sum Path/code.js b/Dynamic Programming/Maximum Sum Path/code.js
@@ -1,4 +1,4 @@
-import { Array2DTracer, LogTracer, Randomize } from 'algorithm-visualizer';
+const { Array2DTracer, LogTracer, Randomize } = require('algorithm-visualizer');
 
 const D = new Randomize.Array2D(5, 5, new Randomize.Integer(1, 5)).create();
 const dataViewer = new Array2DTracer().set(D);
diff --git a/Dynamic Programming/Pascal's Triangle/code.js b/Dynamic Programming/Pascal's Triangle/code.js
@@ -1,4 +1,4 @@
-import { Array2DTracer } from 'algorithm-visualizer';
+const { Array2DTracer } = require('algorithm-visualizer');
 
 const N = 9;
 const A = new Array(N);
diff --git a/Dynamic Programming/Shortest Common Supersequence/code.js b/Dynamic Programming/Shortest Common Supersequence/code.js
@@ -1,4 +1,4 @@
-import { Array1DTracer, Array2DTracer, LogTracer } from 'algorithm-visualizer';
+const { Array1DTracer, Array2DTracer, LogTracer } = require('algorithm-visualizer');
 
 const string1 = 'AGGTAB';
 const string2 = 'GXTXAYB';
diff --git a/Dynamic Programming/Sieve of Eratosthenes/code.js b/Dynamic Programming/Sieve of Eratosthenes/code.js
@@ -1,4 +1,4 @@
-import { Array1DTracer, LogTracer } from 'algorithm-visualizer';
+const { Array1DTracer, LogTracer } = require('algorithm-visualizer');
 
 const tracer = new Array1DTracer('Sieve');
 const N = 30;
diff --git a/Dynamic Programming/Sliding Window/code.js b/Dynamic Programming/Sliding Window/code.js
@@ -1,4 +1,4 @@
-import { Array1DTracer, LogTracer, Randomize } from 'algorithm-visualizer';
+const { Array1DTracer, LogTracer, Randomize } = require('algorithm-visualizer');
 
 const tracer = new Array1DTracer();
 const logger = new LogTracer();
diff --git a/Dynamic Programming/Ugly Numbers/code.js b/Dynamic Programming/Ugly Numbers/code.js
@@ -1,4 +1,4 @@
-import { Array1DTracer, LogTracer } from 'algorithm-visualizer';
+const { Array1DTracer, LogTracer } = require('algorithm-visualizer');
 
 const N = 15;
 const A = new Array(N);
diff --git a/Dynamic Programming/Z String Search/code.js b/Dynamic Programming/Z String Search/code.js
@@ -1,4 +1,4 @@
-import { Array1DTracer, LogTracer } from 'algorithm-visualizer';
+const { Array1DTracer, LogTracer } = require('algorithm-visualizer');
 
 const textTracer = new Array1DTracer('text');
 const pattTracer = new Array1DTracer('pattern');
diff --git a/Greedy/Boyer–Moore's Majority Vote/code.js b/Greedy/Boyer–Moore's Majority Vote/code.js
@@ -1,4 +1,4 @@
-import { Array1DTracer, LogTracer } from 'algorithm-visualizer';
+const { Array1DTracer, LogTracer } = require('algorithm-visualizer');
 
 const A = [1, 3, 3, 2, 1, 1, 1];
 const N = A.length;
diff --git a/Greedy/Dijkstra's Shortest Path/code.js b/Greedy/Dijkstra's Shortest Path/code.js
@@ -1,4 +1,4 @@
-import { Array1DTracer, GraphTracer, LogTracer, Randomize } from 'algorithm-visualizer';
+const { Array1DTracer, GraphTracer, LogTracer, Randomize } = require('algorithm-visualizer');
 
 const tracer = new GraphTracer().directed(false).weighted();
 const tracerS = new Array1DTracer();
diff --git a/Greedy/Job Scheduling Problem/code.js b/Greedy/Job Scheduling Problem/code.js
@@ -1,4 +1,4 @@
-import { Array1DTracer } from 'algorithm-visualizer';
+const { Array1DTracer } = require('algorithm-visualizer');
 
 const jobId = ['a', 'b', 'c', 'd', 'e'];
 const deadline = [2, 1, 2, 1, 3];
diff --git a/Greedy/Kruskal's Minimum Spanning Tree/code.js b/Greedy/Kruskal's Minimum Spanning Tree/code.js
@@ -1,4 +1,4 @@
-import { GraphTracer, LogTracer, Randomize } from 'algorithm-visualizer';
+const { GraphTracer, LogTracer, Randomize } = require('algorithm-visualizer');
 
 const tracer = new GraphTracer().directed(false).weighted();
 const logger = new LogTracer();
diff --git a/Greedy/Prim's Minimum Spanning Tree/code.js b/Greedy/Prim's Minimum Spanning Tree/code.js
@@ -1,4 +1,4 @@
-import { GraphTracer, LogTracer, Randomize } from 'algorithm-visualizer';
+const { GraphTracer, LogTracer, Randomize } = require('algorithm-visualizer');
 
 const tracer = new GraphTracer().directed(false).weighted();
 const logger = new LogTracer();
diff --git a/Greedy/Stable Matching/code.js b/Greedy/Stable Matching/code.js
@@ -1,4 +1,4 @@
-import { Array1DTracer, LogTracer } from 'algorithm-visualizer';
+const { Array1DTracer, LogTracer } = require('algorithm-visualizer');
 
 const ARank = {
   Flavio: ['Valentine', 'July', 'Summer', 'Violet'],
diff --git a/Simple Recursive/Cellular Automata/code.js b/Simple Recursive/Cellular Automata/code.js
diff --git a/Simple Recursive/Euclidean Greatest Common Divisor/code.js b/Simple Recursive/Euclidean Greatest Common Divisor/code.js
diff --git a/Simple Recursive/Suffix Array/code.js b/Simple Recursive/Suffix Array/code.js
diff --git a/Uncategorized/Affine Cipher/code.js b/Uncategorized/Affine Cipher/code.js
diff --git a/Uncategorized/Caesar Cipher/code.js b/Uncategorized/Caesar Cipher/code.js
diff --git a/Uncategorized/Freivalds' Matrix-Multiplication Verification/code.js b/Uncategorized/Freivalds' Matrix-Multiplication Verification/code.js
diff --git a/Uncategorized/Magic Square/code.js b/Uncategorized/Magic Square/code.js
diff --git a/Uncategorized/Maze Generation/code.js b/Uncategorized/Maze Generation/code.js
diff --git a/Uncategorized/Miller-Rabin's Primality Test/code.js b/Uncategorized/Miller-Rabin's Primality Test/code.js

Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-import { Array1DTracer, Array2DTracer, LogTracer } from 'algorithm-visualizer';`
	`1`	`+const { Array1DTracer, Array2DTracer, LogTracer } = require('algorithm-visualizer');`
`2`	`2`
`3`	`3`	`/*`
`4`	`4`	`For N>3 the time taken by this algorithm is sufficiently high`
Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-import { Array2DTracer, LogTracer } from 'algorithm-visualizer';`
	`1`	`+const { Array2DTracer, LogTracer } = require('algorithm-visualizer');`
`2`	`2`
`3`	`3`	`const N = 4; // just change the value of N and the visuals will reflect the configuration!`
`4`	`4`	`const board = (function createArray(N) {`
Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-import { Array1DTracer, GraphTracer, LogTracer } from 'algorithm-visualizer';`
	`1`	`+const { Array1DTracer, GraphTracer, LogTracer } = require('algorithm-visualizer');`
`2`	`2`
`3`	`3`	`const T = {};`
`4`	`4`
Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-import { GraphTracer, LogTracer, Randomize } from 'algorithm-visualizer';`
	`1`	`+const { GraphTracer, LogTracer, Randomize } = require('algorithm-visualizer');`
`2`	`2`
`3`	`3`	`const G = [ // G[i][j] indicates whether the path from the i-th node to the j-th node exists or not`
`4`	`4`	`[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],`
Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-import { Array1DTracer, ChartTracer, LogTracer, Randomize } from 'algorithm-visualizer';`
	`1`	`+const { Array1DTracer, ChartTracer, LogTracer, Randomize } = require('algorithm-visualizer');`
`2`	`2`
`3`	`3`	`const chart = new ChartTracer();`
`4`	`4`	`const tracer = new Array1DTracer().chart(chart);`
Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-import { GraphTracer, LogTracer } from 'algorithm-visualizer';`
	`1`	`+const { GraphTracer, LogTracer } = require('algorithm-visualizer');`
`2`	`2`
`3`	`3`	`const tracer = new GraphTracer();`
`4`	`4`	`const logger = new LogTracer();`
Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-import { Array2DTracer } from 'algorithm-visualizer';`
	`1`	`+const { Array2DTracer } = require('algorithm-visualizer');`
`2`	`2`
`3`	`3`	`const tracer = new Array2DTracer();`
`4`	`4`	`const G = [`
Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-import { Array1DTracer, LogTracer } from 'algorithm-visualizer';`
	`1`	`+const { Array1DTracer, LogTracer } = require('algorithm-visualizer');`
`2`	`2`
`3`	`3`	`const text = ['h', 'e', 'l', 'l', 'o', ' ', 's', 'i', 'r', ' ', 'h', 'e', 'l', 'l', 'o'];`
`4`	`4`	`const pattern = ['h', 'e', 'l', 'l', 'o'];`
Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-import { Array2DTracer, Randomize } from 'algorithm-visualizer';`
	`1`	`+const { Array2DTracer, Randomize } = require('algorithm-visualizer');`
`2`	`2`
`3`	`3`	`const maxValue = 100;`
`4`	`4`	`const arraySize = 10;`
Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-import { Array2DTracer, LogTracer, Randomize } from 'algorithm-visualizer';`
	`1`	`+const { Array2DTracer, LogTracer, Randomize } = require('algorithm-visualizer');`
`2`	`2`
`3`	`3`	`const tracer = new Array2DTracer();`
`4`	`4`	`const logger = new LogTracer();`