Add import statement to algorithm codes

Author: 64json

Backtracking/Knight's tour problem/code.js

@@ -1,3 +1,5 @@
+import { Array1DTracer, Array2DTracer, LogTracer, Tracer } from 'algorithm-visualizer';
+
 /*
 For N>3 the time taken by this algorithm is sufficiently high
 Also it is not possible to visualise for N>6 due to stack overflow

Backtracking/N Queens Problem/code.js

@@ -1,3 +1,5 @@
+import { Array2DTracer, LogTracer, Tracer } from 'algorithm-visualizer';
+
 const N = 4;	// just change the value of N and the visuals will reflect the configuration!
 const board = (function createArray(N) {
   const result = [];

Cryptography/Affine Cipher/code.js

@@ -1,3 +1,5 @@
+import { Array1DTracer, LogTracer, Randomize, Tracer } from 'algorithm-visualizer';
+
 function randString(length) {
   const choices = 'abcdefghijklmnopqrstuvwxyz';
   let text = '';

Cryptography/Caesar Cipher/code.js

@@ -1,3 +1,5 @@
+import { Array1DTracer, LogTracer, Tracer } from 'algorithm-visualizer';
+
 const string = 'hello! how are you doing?';
 const rotation = 5;
 const alphabet = 'abcdefghijklmnopqrstuvwxyz';

Dynamic Programming/Catalan Number/code.js

@@ -1,3 +1,5 @@
+import { Array1DTracer, LogTracer, Tracer } from 'algorithm-visualizer';
+
 const N = 10;
 const A = new Array(N + 1);
 for (let i = N; i >= 0; i--) {

Dynamic Programming/Fibonacci Sequence/code.js

@@ -1,3 +1,5 @@
+import { Array1DTracer, Tracer } from 'algorithm-visualizer';
+
 const tracer = new Array1DTracer('Sequence');
 const index = 15;
 const D = [1, 1];

Dynamic Programming/Integer Partition/code.js

@@ -1,3 +1,5 @@
+import { Array2DTracer, LogTracer, Randomize, Tracer } from 'algorithm-visualizer';
+
 const tracer = new Array2DTracer();
 const logger = new LogTracer();
 const integer = Randomize.integer(5, 14);

Dynamic Programming/Knapsack Problem/code.js

@@ -1,3 +1,5 @@
+import { Array1DTracer, Array2DTracer, LogTracer, Tracer } from '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
 const W = 7; // The maximum weight we can carry in our collection

Dynamic Programming/Longest Common Subsequence/code.js

@@ -1,3 +1,5 @@
+import { Array1DTracer, Array2DTracer, LogTracer, Tracer } from 'algorithm-visualizer';
+
 const string1 = 'AGGTAB';
 const string2 = 'GXTXAYB';
 const m = string1.length;
@@ -20,7 +22,7 @@ for (i = 0; i <= m; i++) {
  	for (j = 0; j <= n; j++) {
  		if (i === 0 || j === 0) {
  			A[i][j] = 0;
- 		} else if (string1[i - 1] == string2[j - 1]) {
+ 		} else if (string1[i - 1] === string2[j - 1]) {
  			tracer1.select(i - 1).wait();
  			tracer2.select(j - 1).wait();
  			tracer3.select(i - 1, j - 1).wait();
@@ -53,7 +55,7 @@ i = m;
 j = n;
 while (i >= 1 && j >= 1) {
   tracer3.select(i, j).wait();
-  if (string1[i - 1] == string2[j - 1]) {
+  if (string1[i - 1] === string2[j - 1]) {
     tracer1.select(i - 1).wait();
  		tracer2.select(j - 1).wait();
 

Dynamic Programming/Longest Increasing Subsequence/code.js

@@ -1,3 +1,5 @@
+import { Array1DTracer, LogTracer, Randomize, Tracer } from 'algorithm-visualizer';
+
 const tracer = new Array1DTracer();
 const logger = new LogTracer();
 const A = Randomize.array1D(10, { min: 0, max: 10 });