Revise GraphData

Author: 64json

Graph Search/All Paths (DFS)/code.js

@@ -27,5 +27,4 @@ for (let i = 0; i < G.length; i++) { // start from every node
   for (let j = 0; j < G.length; j++) D.push(false);
   logger.print(`start from ${i}`);
   DFS(i);
-  tracer.clear();
 }

Graph Search/BFS/code.js

@@ -14,7 +14,7 @@ const G = [ // G[i][j] indicates whether the path from the i-th node to the j-th
   [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],
   [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],
 ];
-tracer.set(G, GraphTracer.LAYOUT.TREE, 0).wait();
+tracer.set(G).layoutTree(0).wait();
 
 function BFS(s) { // s = start node
   const Q = [];

Graph Search/DFS Weighted Graph/code.js

@@ -27,5 +27,4 @@ for (let i = 0; i < G.length; i++) { // start from every node
   D = [];
   for (let j = 0; j < G.length; j++) D.push(false);
   DFS(i, undefined, 0);
-  tracer.clear();
 }

Graph Search/DFS/code.js

@@ -14,7 +14,7 @@ const G = [ // G[i][j] indicates whether the path from the i-th node to the j-th
   [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],
   [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],
 ];
-tracer.set(G, GraphTracer.LAYOUT.TREE, 0).wait();
+tracer.set(G).layoutTree(0).wait();
 
 function DFS(node, parent) { // node = current node, parent = previous node
   tracer.visit(node, parent).wait();

Graph Search/Depth-Limited Search (Counting Descendant)/code.js

@@ -16,7 +16,7 @@ const G = [ // G[i][j] indicates whether the path from the i-th node to the j-th
   [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],
   [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],
 ];
-tracer.set(G, GraphTracer.LAYOUT.TREE, 0).wait();
+tracer.set(G).layoutTree(0).wait();
 
 // This is a sample DLS applications where
 // we try to find number of descendant of root within some depth

Graph Search/Depth-Limited Search/code.js

@@ -16,7 +16,7 @@ const G = [ // G[i][j] indicates whether the path from the i-th node to the j-th
   [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],
   [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],
 ];
-tracer.set(G, GraphTracer.LAYOUT.TREE, 0).wait();
+tracer.set(G).layoutTree(0).wait();
 
 // This is a sample DLS where
 // we try to find number of descendant of root within some depth

Tree/Binary Search Tree Insertion/code.js

@@ -1,15 +1,15 @@
-import { Array1DTracer, LogTracer } from 'algorithm-visualizer';
+import { Array1DTracer, GraphTracer, LogTracer } from 'algorithm-visualizer';
 
 const T = {};
 
-const elements = [5, 8, 10, 3, 1, 6, 9, 7, 2, 0, 4]; // item to be searched
-const tracer = new DirectedGraphConstructTracer(' BST - Elements marked red indicates the current status of tree ', 0);
-const tracer2 = new Array1DTracer(' Elements ').set(elements);
+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 logger = new LogTracer(' Log ');
-tracer.log(logger).wait();
+graphTracer.log(logger).wait();
 
 function bstInsert(root, element, parent) { // root = current node , parent = previous node
-  tracer.visit(root, parent).wait();
+  graphTracer.visit(root, parent).wait();
   const treeNode = T[root];
   let propName = '';
   if (element < root) {
@@ -18,25 +18,25 @@ function bstInsert(root, element, parent) { // root = current node , parent = pr
     propName = 'right';
   }
   if (propName !== '') {
-    if (!treeNode.hasOwnProperty(propName)) { // insert as left child of root
+    if (!(propName in treeNode)) { // insert as left child of root
       treeNode[propName] = element;
       T[element] = {};
-      tracer.addNode(element, root).wait();
-      logger.print(`${element} Inserted `);
+      graphTracer.addNode(element).addEdge(root, element).select(element, root).wait().deselect(element, root);
+      logger.print(`${element} Inserted`);
     } else {
       bstInsert(treeNode[propName], element, root);
     }
   }
+  graphTracer.leave(root, parent).wait();
 }
 
 const Root = elements[0]; // take first element as root
 T[Root] = {};
-tracer.addRoot(Root);
+graphTracer.addNode(Root).layoutTree(Root, true);
 logger.print(`${Root} Inserted as root of tree `);
 
 for (let i = 1; i < elements.length; i++) {
-  tracer2.select(i).wait();
+  elemTracer.select(i).wait();
   bstInsert(Root, elements[i]); // insert ith element
-  tracer2.deselect(i).wait();
-  tracer.clearTraversal();
+  elemTracer.deselect(i).wait();
 }

Tree/Binary Search Tree Searching/code.js

@@ -29,7 +29,7 @@ const T = [ // mapping to G as a binary tree , [i][0] indicates left child, [i][
 ];
 
 const key = Randomize.integer(0, G.length - 1); // item to be searched
-const tracer = new GraphTracer(' Binary Search Tree ').set(G, GraphTracer.LAYOUT.TREE, 5);
+const tracer = new GraphTracer(' Binary Search Tree ').set(G).layoutTree(5);
 const logger = new LogTracer(' Log ');
 tracer.log(logger).wait();
 

Tree/Binary Tree Traversal (Inorder)/code.js

@@ -28,7 +28,7 @@ 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, GraphTracer.LAYOUT.TREE, 5);
+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 ').wait();
 

Tree/Binary Tree Traversal (Postorder)/code.js

@@ -28,7 +28,7 @@ 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, GraphTracer.LAYOUT.TREE, 5);
+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 ').wait();