Break method chains pt.3

Author: 64json

Backtracking/Knight's Tour Problem/code.js

@@ -26,10 +26,13 @@ const Y = [1, 2, 2, 1, -1, -2, -2, -1];
 const pos = new Array(2);
 pos[0] = pos[1] = -1;
 
-const boardTracer = new Array2DTracer('Board').set(board);
-const posTracer = new Array1DTracer('Knight Position').set(pos);
+const boardTracer = new Array2DTracer('Board');
+const posTracer = new Array1DTracer('Knight Position');
 const logTracer = new LogTracer('Console');
-Layout.setRoot(new VerticalLayout([boardTracer, posTracer, logTracer])).delay();
+boardTracer.set(board);
+posTracer.set(pos);
+Layout.setRoot(new VerticalLayout([boardTracer, posTracer, logTracer]));
+Tracer.delay();
 
 function knightTour(x, y, moveNum) {
   if (moveNum === N * N) {

Branch and Bound/Binary Search Tree/insertion.js

@@ -4,9 +4,10 @@ const T = {};
 
 const elements = [5, 8, 10, 3, 1, 6, 9, 7, 2, 0, 4]; // item to be inserted
 const graphTracer = new GraphTracer(' BST - Elements marked red indicates the current status of tree ');
-const elemTracer = new Array1DTracer(' Elements ').set(elements);
+const elemTracer = new Array1DTracer(' Elements ');
 const logger = new LogTracer(' Log ');
 Layout.setRoot(new VerticalLayout([graphTracer, elemTracer, logger]));
+elemTracer.set(elements);
 graphTracer.log(logger);
 Tracer.delay();
 

Branch and Bound/Binary Search Tree/search.js

@@ -29,9 +29,11 @@ const T = [ // mapping to G as a binary tree , [i][0] indicates left child, [i][
 ];
 
 const key = new Randomize.Integer(0, G.length - 1).create(); // item to be searched
-const tracer = new GraphTracer(' Binary Search Tree ').set(G).layoutTree(5);
+const tracer = new GraphTracer(' Binary Search Tree ');
 const logger = new LogTracer(' Log ');
 Layout.setRoot(new VerticalLayout([tracer, logger]));
+tracer.set(G);
+tracer.layoutTree(5);
 tracer.log(logger);
 Tracer.delay();
 

Branch and Bound/Binary Search/iterative.js

@@ -1,11 +1,12 @@
 const { Tracer, Array1DTracer, ChartTracer, LogTracer, Randomize, Layout, VerticalLayout } = require('algorithm-visualizer');
 
 const chart = new ChartTracer();
-const tracer = new Array1DTracer().chart(chart);
+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();
 tracer.set(D);
+tracer.chart(chart);
 Tracer.delay();
 
 function BinarySearch(array, element) { // array = sorted array, element = element to be found

Branch and Bound/Binary Search/recursive.js

@@ -1,11 +1,12 @@
 const { Tracer, Array1DTracer, ChartTracer, LogTracer, Randomize, Layout, VerticalLayout } = require('algorithm-visualizer');
 
 const chart = new ChartTracer();
-const tracer = new Array1DTracer().chart(chart);
+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();
 tracer.set(D);
+tracer.chart(chart);
 Tracer.delay();
 
 function BinarySearch(array, element, minIndex, maxIndex) { // array = sorted array, element = element to be found, minIndex = low index, maxIndex = high index

Brute Force/Binary Tree Traversal/inOrder.js

@@ -28,10 +28,14 @@ const T = [ // mapping to G as a binary tree , [i][0] indicates left child, [i][
   [9, -1],
 ];
 
-const treeTracer = new GraphTracer(' Traversal In-order ').set(G).layoutTree(5);
-const arrayTracer = new Array1DTracer(' Print In-order ').set(new Array(T.length).fill('-'));
-const logger = new LogTracer(' Log ');
-Layout.setRoot(new VerticalLayout([treeTracer, arrayTracer, logger])).delay();
+const treeTracer = new GraphTracer('Traversal In-order');
+const arrayTracer = new Array1DTracer('Print In-order');
+const logger = new LogTracer('Log');
+Layout.setRoot(new VerticalLayout([treeTracer, arrayTracer, logger]));
+treeTracer.set(G);
+treeTracer.layoutTree(5);
+arrayTracer.set(new Array(T.length).fill('-'));
+Tracer.delay();
 
 let index = 0;
 

Brute Force/Binary Tree Traversal/postOrder.js

@@ -28,10 +28,14 @@ const T = [ // mapping to G as a binary tree , [i][0] indicates left child, [i][
   [9, -1],
 ];
 
-const treeTracer = new GraphTracer(' Traversal Post-order ').set(G).layoutTree(5);
-const arrayTracer = new Array1DTracer(' Print Post-order ').set(new Array(T.length).fill('-'));
-const logger = new LogTracer(' Log ');
-Layout.setRoot(new VerticalLayout([treeTracer, arrayTracer, logger])).delay();
+const treeTracer = new GraphTracer('Traversal Post-order');
+const arrayTracer = new Array1DTracer('Print Post-order');
+const logger = new LogTracer('Log');
+Layout.setRoot(new VerticalLayout([treeTracer, arrayTracer, logger]));
+treeTracer.set(G);
+treeTracer.layoutTree(5);
+arrayTracer.set(new Array(T.length).fill('-'));
+Tracer.delay();
 
 let index = 0;
 

Brute Force/Binary Tree Traversal/preOrder.js

@@ -28,10 +28,14 @@ const T = [ // mapping to G as a binary tree , [i][0] indicates left child, [i][
   [9, -1],
 ];
 
-const treeTracer = new GraphTracer(' Traversal Pre-order ').set(G).layoutTree(5);
-const arrayTracer = new Array1DTracer(' Print Pre-order ').set(new Array(T.length).fill('-'));
-const logger = new LogTracer(' Log ');
-Layout.setRoot(new VerticalLayout([treeTracer, arrayTracer, logger])).delay();
+const treeTracer = new GraphTracer('Traversal Pre-order');
+const arrayTracer = new Array1DTracer('Print Pre-order');
+const logger = new LogTracer('Log');
+Layout.setRoot(new VerticalLayout([treeTracer, arrayTracer, logger]));
+treeTracer.set(G);
+treeTracer.layoutTree(5);
+arrayTracer.set(new Array(T.length).fill('-'));
+Tracer.delay();
 
 let index = 0;
 

Brute Force/Bipartiteness Test/code.js

@@ -14,7 +14,8 @@ const G = [
 tracer.set(G);
 
 const colorsTracer = new Array1DTracer('Colors');
-Layout.setRoot(new VerticalLayout([tracer, logger, colorsTracer])).delay();
+Layout.setRoot(new VerticalLayout([tracer, logger, colorsTracer]));
+Tracer.delay();
 
 function BFSCheckBipartiteness(s) {
   const Q = [];

Brute Force/Bubble Sort/code.js

@@ -1,11 +1,12 @@
 const { Tracer, Array1DTracer, ChartTracer, LogTracer, Randomize, Layout, VerticalLayout } = require('algorithm-visualizer');
 
 const chart = new ChartTracer();
-const tracer = new Array1DTracer().chart(chart);
+const tracer = new Array1DTracer();
 const logger = new LogTracer();
 Layout.setRoot(new VerticalLayout([chart, tracer, logger]));
 const D = new Randomize.Array1D(15).create();
 tracer.set(D);
+tracer.chart(chart);
 Tracer.delay();
 
 logger.println(`original array = [${D.join(', ')}]`);