Skip to content

Commit 894df28

Browse files
64json64json
committed
Break method chains pt.3
1 parent 4a5d534 commit 894df28

File tree

38 files changed

+170
-87
lines changed

38 files changed

+170
-87
lines changed

‎Backtracking/Knight's Tour Problem/code.js

Lines changed: 6 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -26,10 +26,13 @@ const Y = [1, 2, 2, 1, -1, -2, -2, -1];
2626
const pos = new Array(2);
2727
pos[0] = pos[1] = -1;
2828

29-
const boardTracer = new Array2DTracer('Board').set(board);
30-
const posTracer = new Array1DTracer('Knight Position').set(pos);
29+
const boardTracer = new Array2DTracer('Board');
30+
const posTracer = new Array1DTracer('Knight Position');
3131
const logTracer = new LogTracer('Console');
32-
Layout.setRoot(new VerticalLayout([boardTracer, posTracer, logTracer])).delay();
32+
boardTracer.set(board);
33+
posTracer.set(pos);
34+
Layout.setRoot(new VerticalLayout([boardTracer, posTracer, logTracer]));
35+
Tracer.delay();
3336

3437
function knightTour(x, y, moveNum) {
3538
if (moveNum === N * N) {

‎Branch and Bound/Binary Search Tree/insertion.js

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -4,9 +4,10 @@ const T = {};
44

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

‎Branch and Bound/Binary Search Tree/search.js

Lines changed: 3 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -29,9 +29,11 @@ const T = [ // mapping to G as a binary tree , [i][0] indicates left child, [i][
2929
];
3030

3131
const key = new Randomize.Integer(0, G.length - 1).create(); // item to be searched
32-
const tracer = new GraphTracer(' Binary Search Tree ').set(G).layoutTree(5);
32+
const tracer = new GraphTracer(' Binary Search Tree ');
3333
const logger = new LogTracer(' Log ');
3434
Layout.setRoot(new VerticalLayout([tracer, logger]));
35+
tracer.set(G);
36+
tracer.layoutTree(5);
3537
tracer.log(logger);
3638
Tracer.delay();
3739

‎Branch and Bound/Binary Search/iterative.js

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,11 +1,12 @@
11
const { Tracer, Array1DTracer, ChartTracer, LogTracer, Randomize, Layout, VerticalLayout } = require('algorithm-visualizer');
22

33
const chart = new ChartTracer();
4-
const tracer = new Array1DTracer().chart(chart);
4+
const tracer = new Array1DTracer();
55
const logger = new LogTracer();
66
Layout.setRoot(new VerticalLayout([chart, tracer, logger]));
77
const D = new Randomize.Array1D(15, new Randomize.Integer(0, 50)).sorted().create();
88
tracer.set(D);
9+
tracer.chart(chart);
910
Tracer.delay();
1011

1112
function BinarySearch(array, element) { // array = sorted array, element = element to be found

‎Branch and Bound/Binary Search/recursive.js

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,11 +1,12 @@
11
const { Tracer, Array1DTracer, ChartTracer, LogTracer, Randomize, Layout, VerticalLayout } = require('algorithm-visualizer');
22

33
const chart = new ChartTracer();
4-
const tracer = new Array1DTracer().chart(chart);
4+
const tracer = new Array1DTracer();
55
const logger = new LogTracer();
66
Layout.setRoot(new VerticalLayout([chart, tracer, logger]));
77
const D = new Randomize.Array1D(15, new Randomize.Integer(0, 50)).sorted().create();
88
tracer.set(D);
9+
tracer.chart(chart);
910
Tracer.delay();
1011

1112
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

Lines changed: 8 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -28,10 +28,14 @@ const T = [ // mapping to G as a binary tree , [i][0] indicates left child, [i][
2828
[9, -1],
2929
];
3030

31-
const treeTracer = new GraphTracer(' Traversal In-order ').set(G).layoutTree(5);
32-
const arrayTracer = new Array1DTracer(' Print In-order ').set(new Array(T.length).fill('-'));
33-
const logger = new LogTracer(' Log ');
34-
Layout.setRoot(new VerticalLayout([treeTracer, arrayTracer, logger])).delay();
31+
const treeTracer = new GraphTracer('Traversal In-order');
32+
const arrayTracer = new Array1DTracer('Print In-order');
33+
const logger = new LogTracer('Log');
34+
Layout.setRoot(new VerticalLayout([treeTracer, arrayTracer, logger]));
35+
treeTracer.set(G);
36+
treeTracer.layoutTree(5);
37+
arrayTracer.set(new Array(T.length).fill('-'));
38+
Tracer.delay();
3539

3640
let index = 0;
3741

‎Brute Force/Binary Tree Traversal/postOrder.js

Lines changed: 8 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -28,10 +28,14 @@ const T = [ // mapping to G as a binary tree , [i][0] indicates left child, [i][
2828
[9, -1],
2929
];
3030

31-
const treeTracer = new GraphTracer(' Traversal Post-order ').set(G).layoutTree(5);
32-
const arrayTracer = new Array1DTracer(' Print Post-order ').set(new Array(T.length).fill('-'));
33-
const logger = new LogTracer(' Log ');
34-
Layout.setRoot(new VerticalLayout([treeTracer, arrayTracer, logger])).delay();
31+
const treeTracer = new GraphTracer('Traversal Post-order');
32+
const arrayTracer = new Array1DTracer('Print Post-order');
33+
const logger = new LogTracer('Log');
34+
Layout.setRoot(new VerticalLayout([treeTracer, arrayTracer, logger]));
35+
treeTracer.set(G);
36+
treeTracer.layoutTree(5);
37+
arrayTracer.set(new Array(T.length).fill('-'));
38+
Tracer.delay();
3539

3640
let index = 0;
3741

‎Brute Force/Binary Tree Traversal/preOrder.js

Lines changed: 8 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -28,10 +28,14 @@ const T = [ // mapping to G as a binary tree , [i][0] indicates left child, [i][
2828
[9, -1],
2929
];
3030

31-
const treeTracer = new GraphTracer(' Traversal Pre-order ').set(G).layoutTree(5);
32-
const arrayTracer = new Array1DTracer(' Print Pre-order ').set(new Array(T.length).fill('-'));
33-
const logger = new LogTracer(' Log ');
34-
Layout.setRoot(new VerticalLayout([treeTracer, arrayTracer, logger])).delay();
31+
const treeTracer = new GraphTracer('Traversal Pre-order');
32+
const arrayTracer = new Array1DTracer('Print Pre-order');
33+
const logger = new LogTracer('Log');
34+
Layout.setRoot(new VerticalLayout([treeTracer, arrayTracer, logger]));
35+
treeTracer.set(G);
36+
treeTracer.layoutTree(5);
37+
arrayTracer.set(new Array(T.length).fill('-'));
38+
Tracer.delay();
3539

3640
let index = 0;
3741

‎Brute Force/Bipartiteness Test/code.js

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -14,7 +14,8 @@ const G = [
1414
tracer.set(G);
1515

1616
const colorsTracer = new Array1DTracer('Colors');
17-
Layout.setRoot(new VerticalLayout([tracer, logger, colorsTracer])).delay();
17+
Layout.setRoot(new VerticalLayout([tracer, logger, colorsTracer]));
18+
Tracer.delay();
1819

1920
function BFSCheckBipartiteness(s) {
2021
const Q = [];

‎Brute Force/Bubble Sort/code.js

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,11 +1,12 @@
11
const { Tracer, Array1DTracer, ChartTracer, LogTracer, Randomize, Layout, VerticalLayout } = require('algorithm-visualizer');
22

33
const chart = new ChartTracer();
4-
const tracer = new Array1DTracer().chart(chart);
4+
const tracer = new Array1DTracer();
55
const logger = new LogTracer();
66
Layout.setRoot(new VerticalLayout([chart, tracer, logger]));
77
const D = new Randomize.Array1D(15).create();
88
tracer.set(D);
9+
tracer.chart(chart);
910
Tracer.delay();
1011

1112
logger.println(`original array = [${D.join(', ')}]`);

0 commit comments

Comments
 (0)
pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy