Adjust to the updated Randomize functions in tracers.js

64json · 64json · commit ef4636934f3a · 2019-06-13T14:43:47.000+09:00
diff --git a/Branch and Bound/Binary Search Tree/search.js b/Branch and Bound/Binary Search Tree/search.js
@@ -28,7 +28,7 @@ const T = [ // mapping to G as a binary tree , [i][0] indicates left child, [i][
   [9, -1],
 ];
 
-const key = new Randomize.Integer(0, G.length - 1).create(); // item to be searched
+const key = Randomize.Integer({ min: 0, max: G.length - 1 }); // item to be searched
 const tracer = new GraphTracer(' Binary Search Tree ');
 const logger = new LogTracer(' Log ');
 Layout.setRoot(new VerticalLayout([tracer, logger]));
diff --git a/Branch and Bound/Binary Search/iterative.js b/Branch and Bound/Binary Search/iterative.js
@@ -4,7 +4,7 @@ const chart = new ChartTracer();
 const tracer = new Array1DTracer();
 const logger = new LogTracer();
 Layout.setRoot(new VerticalLayout([chart, tracer, logger]));
-const D = new Randomize.Array1D(15, new Randomize.Integer(0, 50)).sorted().create();
+const D = Randomize.Array1D({ N: 15, value: () => Randomize.Integer({ min: 0, max: 50 }), sorted: true });
 tracer.set(D);
 tracer.chart(chart);
 Tracer.delay();
@@ -44,7 +44,7 @@ function BinarySearch(array, element) { // array = sorted array, element = eleme
   return -1;
 }
 
-const element = D[new Randomize.Integer(0, D.length - 1).create()];
+const element = D[Randomize.Integer({ min: 0, max: D.length - 1 })];
 
 logger.println(`Using iterative binary search to find ${element}`);
 BinarySearch(D, element);
diff --git a/Branch and Bound/Binary Search/recursive.js b/Branch and Bound/Binary Search/recursive.js
@@ -4,7 +4,7 @@ const chart = new ChartTracer();
 const tracer = new Array1DTracer();
 const logger = new LogTracer();
 Layout.setRoot(new VerticalLayout([chart, tracer, logger]));
-const D = new Randomize.Array1D(15, new Randomize.Integer(0, 50)).sorted().create();
+const D = Randomize.Array1D({ N: 15, value: () => Randomize.Integer({ min: 0, max: 50 }), sorted: true });
 tracer.set(D);
 tracer.chart(chart);
 Tracer.delay();
@@ -46,7 +46,7 @@ function BinarySearch(array, element, minIndex, maxIndex) { // array = sorted ar
   return -1;
 }
 
-const element = D[new Randomize.Integer(0, D.length - 1).create()];
+const element = D[Randomize.Integer({ min: 0, max: D.length - 1 })];
 
 logger.println(`Using binary search to find ${element}`);
 BinarySearch(D, element, 0, D.length - 1);
diff --git a/Branch and Bound/Depth-Limited Search/code.js b/Branch and Bound/Depth-Limited Search/code.js
@@ -37,4 +37,5 @@ function DLSCount(limit, node, parent) { // node = current node, parent = previo
   }
   return child;
 }
+
 logger.println(`Number of descendant is ${DLSCount(2, 0)}`);
diff --git a/Brute Force/Breadth-First Search/shortestPath.js b/Brute Force/Breadth-First Search/shortestPath.js
@@ -4,7 +4,7 @@ const tracer = new GraphTracer().directed(false).weighted();
 const logger = new LogTracer();
 Layout.setRoot(new VerticalLayout([tracer, logger]));
 tracer.log(logger);
-const G = new Randomize.Graph(5, 1).directed(false).weighted().create();
+const G = Randomize.Graph({ N: 5, ratio: 1, directed: false, weighted: true });
 tracer.set(G);
 Tracer.delay();
 
@@ -36,10 +36,10 @@ function BFS() {
   return W[e];
 }
 
-let s = new Randomize.Integer(0, G.length - 1).create(); // s = start node
+let s = Randomize.Integer({ min: 0, max: G.length - 1 }); // s = start node
 let e; // e = start node
 do {
-  e = new Randomize.Integer(0, G.length - 1).create();
+  e = Randomize.Integer({ min: 0, max: G.length - 1 });
 } while (s === e);
 let MAX_VALUE = 0x7fffffff;
 logger.println(`finding the shortest path from ${s} to ${e}`);
diff --git a/Brute Force/Breadth-First Search/tree.js b/Brute Force/Breadth-First Search/tree.js
@@ -37,4 +37,5 @@ function BFS(s) { // s = start node
     }
   }
 }
+
 BFS(0);
diff --git a/Brute Force/Bubble Sort/code.js b/Brute Force/Bubble Sort/code.js
@@ -4,7 +4,7 @@ const chart = new ChartTracer();
 const tracer = new Array1DTracer();
 const logger = new LogTracer();
 Layout.setRoot(new VerticalLayout([chart, tracer, logger]));
-const D = new Randomize.Array1D(15).create();
+const D = Randomize.Array1D({ N: 15 });
 tracer.set(D);
 tracer.chart(chart);
 Tracer.delay();
diff --git a/Brute Force/Comb Sort/code.js b/Brute Force/Comb Sort/code.js
@@ -4,7 +4,7 @@ const chart = new ChartTracer();
 const tracer = new Array1DTracer();
 const logger = new LogTracer();
 Layout.setRoot(new VerticalLayout([chart, tracer, logger]));
-const D = new Randomize.Array1D(15).create();
+const D = Randomize.Array1D({ N: 15 });
 tracer.set(D);
 tracer.chart(chart);
 Tracer.delay();
diff --git a/Brute Force/Cycle Sort/code.js b/Brute Force/Cycle Sort/code.js
@@ -4,7 +4,7 @@ const chart = new ChartTracer();
 const tracer = new Array1DTracer();
 const logger = new LogTracer();
 Layout.setRoot(new VerticalLayout([chart, tracer, logger]));
-const D = new Randomize.Array1D(15).create();
+const D = Randomize.Array1D({ N: 15 });
 tracer.set(D);
 tracer.chart(chart);
 Tracer.delay();
diff --git a/Brute Force/Depth-First Search/graph.js b/Brute Force/Depth-First Search/graph.js
@@ -5,7 +5,7 @@ const visitedTracer = new Array1DTracer('visited');
 const logger = new LogTracer();
 Layout.setRoot(new VerticalLayout([graphTracer, visitedTracer, logger]));
 graphTracer.log(logger);
-const G = new Randomize.Graph(8, .3).directed(false).create();
+const G = Randomize.Graph({ N: 8, ratio: .3, directed: false });
 graphTracer.set(G);
 Tracer.delay();
 
diff --git a/Brute Force/Depth-First Search/shortestPath.js b/Brute Force/Depth-First Search/shortestPath.js
@@ -4,7 +4,7 @@ const tracer = new GraphTracer().directed(false).weighted();
 const logger = new LogTracer();
 Layout.setRoot(new VerticalLayout([tracer, logger]));
 tracer.log(logger);
-const G = new Randomize.Graph(5, 1).directed(false).weighted().create();
+const G = Randomize.Graph({ N: 5, ratio: 1, directed: false, weighted: true });
 tracer.set(G);
 Tracer.delay();
 
@@ -35,10 +35,10 @@ function DFS(node, parent, weight) { // node = current node, parent = previous n
   Tracer.delay();
 }
 
-const s = new Randomize.Integer(0, G.length - 1).create(); // s = start node
+const s = Randomize.Integer({ min: 0, max: G.length - 1 }); // s = start node
 let e; // e = end node
 do {
-  e = new Randomize.Integer(0, G.length - 1).create();
+  e = Randomize.Integer({ min: 0, max: G.length - 1 });
 } while (s === e);
 const MAX_VALUE = Infinity;
 let minWeight = MAX_VALUE;
diff --git a/Brute Force/Depth-First Search/weightedGraph.js b/Brute Force/Depth-First Search/weightedGraph.js
@@ -4,7 +4,7 @@ const tracer = new GraphTracer().directed(false).weighted();
 const logger = new LogTracer();
 Layout.setRoot(new VerticalLayout([tracer, logger]));
 tracer.log(logger);
-const G = new Randomize.Graph(5, 1).directed(false).weighted().create();
+const G = Randomize.Graph({ N: 5, ratio: 1, directed: false, weighted: true });
 tracer.set(G);
 Tracer.delay();
 
diff --git a/Brute Force/Heapsort/code.js b/Brute Force/Heapsort/code.js
@@ -4,7 +4,7 @@ const chart = new ChartTracer();
 const tracer = new Array1DTracer();
 const logger = new LogTracer();
 Layout.setRoot(new VerticalLayout([chart, tracer, logger]));
-const D = new Randomize.Array1D(10).create();
+const D = Randomize.Array1D({ N: 10 });
 tracer.set(D);
 tracer.chart(chart);
 Tracer.delay();
diff --git a/Brute Force/Insertion Sort/code.js b/Brute Force/Insertion Sort/code.js
@@ -4,7 +4,7 @@ const chart = new ChartTracer();
 const tracer = new Array1DTracer();
 const logger = new LogTracer();
 Layout.setRoot(new VerticalLayout([chart, tracer, logger]));
-const D = new Randomize.Array1D(15).create();
+const D = Randomize.Array1D({ N: 15 });
 tracer.set(D);
 tracer.chart(chart);
 Tracer.delay();
diff --git a/Brute Force/PageRank/code.js b/Brute Force/PageRank/code.js
@@ -4,7 +4,7 @@ function filledArray(length, value) {
   return Array(...Array(length)).map(Number.prototype.valueOf, value);
 }
 
-const G = new Randomize.Graph(5, .4).create();
+const G = Randomize.Graph({ N: 5, ratio: .4 });
 let ranks;
 const outgoingEdgeCounts = filledArray(G.length, 0);
 let incomingNodes;
diff --git a/Brute Force/Pancake Sort/code.js b/Brute Force/Pancake Sort/code.js
@@ -4,13 +4,14 @@ const chart = new ChartTracer();
 const tracer = new Array1DTracer();
 const logger = new LogTracer();
 Layout.setRoot(new VerticalLayout([chart, tracer, logger]));
-const D = new Randomize.Array1D(10).create();
+const D = Randomize.Array1D({ N: 10 });
 tracer.set(D);
 tracer.chart(chart);
 Tracer.delay();
 
 logger.println(`original array = [${D.join(', ')}]`);
 const N = D.length;
+
 function flip(start) {
   tracer.select(start, N - 1);
   Tracer.delay();
@@ -31,10 +32,14 @@ function flip(start) {
   }
   tracer.deselect(start, N - 1);
 }
+
 for (let i = 0; i < N - 1; i++) {
   logger.println(`round ${i + 1}`);
   const currArr = D.slice(i, N);
-  const currMax = currArr.reduce((prev, curr, idx) => ((curr > prev.val) ? { idx, val: curr } : prev), { idx: 0, val: currArr[0] });
+  const currMax = currArr.reduce((prev, curr, idx) => ((curr > prev.val) ? { idx, val: curr } : prev), {
+    idx: 0,
+    val: currArr[0],
+  });
   if (currMax.idx !== 0) { // if currMax.idx === 0 that means max element already at the bottom, no flip required
     logger.println(`flip at ${currMax.idx + i} (step 1)`);
     flip(currMax.idx + i, N);
diff --git a/Brute Force/Selection Sort/code.js b/Brute Force/Selection Sort/code.js
@@ -4,7 +4,7 @@ const chart = new ChartTracer();
 const tracer = new Array1DTracer();
 const logger = new LogTracer();
 Layout.setRoot(new VerticalLayout([chart, tracer, logger]));
-const D = new Randomize.Array1D(15).create();
+const D = Randomize.Array1D({ N: 15 });
 tracer.set(D);
 tracer.chart(chart);
 Tracer.delay();
diff --git a/Brute Force/Shellsort/code.js b/Brute Force/Shellsort/code.js
@@ -4,7 +4,7 @@ const chart = new ChartTracer();
 const tracer = new Array1DTracer();
 const logger = new LogTracer();
 Layout.setRoot(new VerticalLayout([chart, tracer, logger]));
-const D = new Randomize.Array1D(15).create();
+const D = Randomize.Array1D({ N: 15 });
 tracer.set(D);
 tracer.chart(chart);
 Tracer.delay();
diff --git a/Divide and Conquer/Bucket Sort/code.js b/Divide and Conquer/Bucket Sort/code.js
@@ -12,7 +12,7 @@ Layout.setRoot(new VerticalLayout([chartTracer, arrayTracer, bucketsTracer]));
 // define input variables
 const N = 25; // the size of an array
 const K = 5; // the number of buckets
-const array = new Randomize.Array1D(N, new Randomize.Integer(0, 999)).create();
+const array = Randomize.Array1D({ N, value: () => Randomize.Integer({ min: 0, max: 999 }) });
 
 (function main() {
   // create K buckets
diff --git a/Divide and Conquer/Counting Sort/code.js b/Divide and Conquer/Counting Sort/code.js
@@ -11,7 +11,7 @@ Layout.setRoot(new VerticalLayout([arrayTracer, countsTracer, sortedArrayTracer]
 
 // define input variables
 const N = 20; // the size of an array
-const array = new Randomize.Array1D(N, new Randomize.Integer(0, 9)).create();
+const array = Randomize.Array1D({ N, value: () => Randomize.Integer({ min: 0, max: 9 }) });
 
 (function main() {
   // find the maximum value that will decide the size of counts array
diff --git a/Divide and Conquer/Merge Sort/bottomUp.js b/Divide and Conquer/Merge Sort/bottomUp.js
@@ -4,8 +4,8 @@ const tracer = new Array2DTracer();
 const logger = new LogTracer();
 Layout.setRoot(new VerticalLayout([tracer, logger]));
 const D = [
-  new Randomize.Array1D(20, new Randomize.Integer(0, 50)).create(),
-  new Randomize.Array1D(20, new Randomize.Integer(0, 0)).create(),
+  Randomize.Array1D({ N: 20, value: () => Randomize.Integer({ min: 0, max: 50 }) }),
+  Randomize.Array1D({ N: 20, value: () => Randomize.Integer({ min: 0, max: 0 }) }),
 ];
 
 tracer.set(D);
diff --git a/Divide and Conquer/Merge Sort/topDown.js b/Divide and Conquer/Merge Sort/topDown.js
@@ -4,7 +4,7 @@ const chart = new ChartTracer();
 const tracer = new Array1DTracer();
 const logger = new LogTracer();
 Layout.setRoot(new VerticalLayout([chart, tracer, logger]));
-const D = new Randomize.Array1D(15).create();
+const D = Randomize.Array1D({ N: 15 });
 tracer.set(D);
 tracer.chart(chart);
 Tracer.delay();
diff --git a/Divide and Conquer/Pigeonhole Sort/code.js b/Divide and Conquer/Pigeonhole Sort/code.js
@@ -1,6 +1,6 @@
 const { Tracer, Array1DTracer, Array2DTracer, LogTracer, Randomize, Layout, VerticalLayout } = require('algorithm-visualizer');
 
-const A = new Randomize.Array1D(7).create();
+const A = Randomize.Array1D({ N: 7 });
 const N = A.length;
 
 const tracer1 = new Array1DTracer('Array');
diff --git a/Divide and Conquer/Quicksort/code.js b/Divide and Conquer/Quicksort/code.js
@@ -4,7 +4,7 @@ const chart = new ChartTracer();
 const tracer = new Array1DTracer();
 const logger = new LogTracer();
 Layout.setRoot(new VerticalLayout([chart, tracer, logger]));
-const D = new Randomize.Array1D(15).create();
+const D = Randomize.Array1D({ N: 15 });
 tracer.set(D);
 tracer.chart(chart);
 Tracer.delay();
diff --git a/Divide and Conquer/Radix Sort/leastSignificantDigit.js b/Divide and Conquer/Radix Sort/leastSignificantDigit.js
@@ -3,7 +3,7 @@ const { Tracer, Array2DTracer, LogTracer, Randomize, Layout, VerticalLayout } =
 const tracer = new Array2DTracer();
 const logger = new LogTracer();
 Layout.setRoot(new VerticalLayout([tracer, logger]));
-const k = new Randomize.Array1D(10, new Randomize.Integer(1, 999)).create();
+const k = Randomize.Array1D({ N: 10, value: () => Randomize.Integer({ min: 1, max: 999 }) });
 const D = [
   k,
   [0, 0, 0, 0, 0, 0, 0, 0, 0, 0],
diff --git a/Dynamic Programming/Bellman-Ford's Shortest Path/code.js b/Dynamic Programming/Bellman-Ford's Shortest Path/code.js
@@ -4,7 +4,7 @@ const tracer = new GraphTracer().weighted();
 const logger = new LogTracer();
 Layout.setRoot(new VerticalLayout([tracer, logger]));
 tracer.log(logger);
-const G = new Randomize.Graph(5, .5, new Randomize.Integer(-2, 5)).weighted().create();
+const G = Randomize.Graph({ N: 5, ratio: .5, value: () => Randomize.Integer({ min: -2, max: 5 }), weighted: true });
 tracer.set(G);
 Tracer.delay();
 
@@ -66,7 +66,7 @@ function BELLMAN_FORD(src, dest) {
   return weights[dest];
 }
 
-const src = new Randomize.Integer(0, G.length - 1).create();
+const src = Randomize.Integer({ min: 0, max: G.length - 1 });
 let dest;
 let MAX_VALUE = 0x7fffffff;
 let minWeight;
@@ -77,7 +77,7 @@ let minWeight;
  */
 
 do {
-  dest = new Randomize.Integer(0, G.length - 1).create();
+  dest = Randomize.Integer({ min: 0, max: G.length - 1 });
 }
 while (src === dest);
 
diff --git a/Dynamic Programming/Floyd-Warshall's Shortest Path/code.js b/Dynamic Programming/Floyd-Warshall's Shortest Path/code.js
@@ -4,7 +4,7 @@ const tracer = new GraphTracer().weighted();
 const logger = new LogTracer();
 Layout.setRoot(new VerticalLayout([tracer, logger]));
 tracer.log(logger);
-const G = new Randomize.Graph(5, 1).weighted().create();
+const G = Randomize.Graph({ N: 5, ratio: 1, weighted: true });
 tracer.set(G);
 Tracer.delay();
 
diff --git a/Dynamic Programming/Integer Partition/code.js b/Dynamic Programming/Integer Partition/code.js
@@ -3,7 +3,7 @@ const { Tracer, Array2DTracer, LogTracer, Randomize, Layout, VerticalLayout } =
 const tracer = new Array2DTracer();
 const logger = new LogTracer();
 Layout.setRoot(new VerticalLayout([tracer, logger]));
-const integer = new Randomize.Integer(5, 14).create();
+const integer = Randomize.Integer({ min: 5, max: 14 });
 const D = [];
 const A = [];
 for (let i = 0; i <= integer; i++) {
diff --git a/Dynamic Programming/Longest Increasing Subsequence/code.js b/Dynamic Programming/Longest Increasing Subsequence/code.js
@@ -3,7 +3,7 @@ const { Tracer, Array1DTracer, LogTracer, Randomize, Layout, VerticalLayout } =
 const tracer = new Array1DTracer();
 const logger = new LogTracer();
 Layout.setRoot(new VerticalLayout([tracer, logger]));
-const A = new Randomize.Array1D(10, new Randomize.Integer(0, 10)).create();
+const A = Randomize.Array1D({ N: 10, value: () => Randomize.Integer({ min: 0, max: 10 }) });
 const LIS = new Array(A.length);
 tracer.set(A);
 Tracer.delay();
diff --git a/Dynamic Programming/Longest Palindromic Subsequence/code.js b/Dynamic Programming/Longest Palindromic Subsequence/code.js
@@ -30,6 +30,7 @@ function max(a, b) {
   }
   return b;
 }
+
 logger.println('LPS for any string with length = 1 is 1');
 for (i = 2; i <= N; i++) {
   logger.println('--------------------------------------------------');
diff --git a/Dynamic Programming/Maximum Sum Path/code.js b/Dynamic Programming/Maximum Sum Path/code.js
@@ -1,6 +1,6 @@
 const { Tracer, Array2DTracer, LogTracer, Randomize, Layout, VerticalLayout } = require('algorithm-visualizer');
 
-const D = new Randomize.Array2D(5, 5, new Randomize.Integer(1, 5)).create();
+const D = Randomize.Array2D({ N: 5, M: 5, value: () => Randomize.Integer({ min: 1, max: 5 }) });
 const dataViewer = new Array2DTracer();
 const tracer = new Array2DTracer('Results Table');
 const logger = new LogTracer();
diff --git a/Dynamic Programming/Sliding Window/code.js b/Dynamic Programming/Sliding Window/code.js
@@ -3,7 +3,7 @@ const { Tracer, Array1DTracer, LogTracer, Randomize, Layout, VerticalLayout } =
 const tracer = new Array1DTracer();
 const logger = new LogTracer();
 Layout.setRoot(new VerticalLayout([tracer, logger]));
-const D = new Randomize.Array1D(20, new Randomize.Integer(-5, 5)).create();
+const D = Randomize.Array1D({ N: 20, value: () => Randomize.Integer({ min: -5, max: 5 }) });
 tracer.set(D);
 Tracer.delay();
 
diff --git a/Dynamic Programming/Z String Search/code.js b/Dynamic Programming/Z String Search/code.js
diff --git a/Greedy/Dijkstra's Shortest Path/code.js b/Greedy/Dijkstra's Shortest Path/code.js
diff --git a/Greedy/Kruskal's Minimum Spanning Tree/code.js b/Greedy/Kruskal's Minimum Spanning Tree/code.js
diff --git a/Greedy/Prim's Minimum Spanning Tree/code.js b/Greedy/Prim's Minimum Spanning Tree/code.js
diff --git a/Greedy/Stable Matching/code.js b/Greedy/Stable Matching/code.js
diff --git a/Uncategorized/Affine Cipher/code.js b/Uncategorized/Affine Cipher/code.js

Original file line number	Diff line number	Diff line change
`@@ -37,4 +37,5 @@ function DLSCount(limit, node, parent) { // node = current node, parent = previo`
`37`	`37`	`}`
`38`	`38`	`return child;`
`39`	`39`	`}`
	`40`	`+`
`40`	`41`	logger.println(`Number of descendant is ${DLSCount(2, 0)}`);
Original file line number	Diff line number	Diff line change
`@@ -37,4 +37,5 @@ function BFS(s) { // s = start node`
`37`	`37`	`}`
`38`	`38`	`}`
`39`	`39`	`}`
	`40`	`+`
`40`	`41`	`BFS(0);`