Improve Knapsack Problem

* missing subproblem visualization

* error in patch

* fixed opt problem patch

* Remove unnecessary delays and change unnecessary patch to select

Author: dmrodriqu

Dynamic Programming/Knapsack Problem/code.js

@@ -17,13 +17,13 @@ for (let i = 0; i < N + 1; i++) {
 
 // define tracer variables {
 const tracer = new Array2DTracer('Knapsack Table');
-const dataViewer1 = new Array1DTracer('Values');
-const dataViewer2 = new Array1DTracer('Weights');
+const valuesTracer = new Array1DTracer('Values');
+const weightsTracer = new Array1DTracer('Weights');
 const logger = new LogTracer();
-Layout.setRoot(new VerticalLayout([tracer, dataViewer1, dataViewer2, logger]));
+Layout.setRoot(new VerticalLayout([tracer, valuesTracer, weightsTracer, logger]));
 tracer.set(DP);
-dataViewer1.set(val);
-dataViewer2.set(wt);
+valuesTracer.set(val);
+weightsTracer.set(wt);
 Tracer.delay();
 // }
 
@@ -42,14 +42,13 @@ for (let i = 0; i <= N; i++) {
       // }
     } else if (wt[i - 1] <= j) { // take the current item in our collection
       // visualize {
-      dataViewer1.select(i - 1);
-      Tracer.delay();
-      dataViewer2.select(i - 1);
+      weightsTracer.select(i - 1);
+      valuesTracer.select(i - 1);
       Tracer.delay();
+      tracer.select(i - 1, j - wt[i - 1]);
       tracer.select(i - 1, j);
       Tracer.delay();
       // }
-
       const A = val[i - 1] + DP[i - 1][j - wt[i - 1]];
       const B = DP[i - 1][j];
       /*
@@ -69,12 +68,13 @@ for (let i = 0; i <= N; i++) {
         Tracer.delay();
         // }
       }
-
       // visualize {
-      tracer.deselect(i - 1, j);
+      // opt subproblem depatch
       tracer.depatch(i, j);
-      dataViewer2.deselect(i - 1);
-      dataViewer1.deselect(i - 1);
+      tracer.deselect(i - 1, j);
+      tracer.deselect(i - 1, j - wt[i - 1]);
+      valuesTracer.deselect(i - 1);
+      weightsTracer.deselect(i - 1);
       // }
     } else { // leave the current item from our collection
       DP[i][j] = DP[i - 1][j];