add max_sum_path

64json · 64json · commit dfb70007026e · 2016-05-20T11:44:49.000-05:00
diff --git a/algorithm/etc/dp/config.json b/algorithm/etc/dp/config.json
@@ -10,6 +10,7 @@
   ],
   "files": {
     "fibonacci": "Fibonacci Sequence",
-    "sliding_window": "Finding the largest sum of three contiguous number"
+    "sliding_window": "Finding the largest sum of three contiguous number",
+    "max_sum_path": "Finding the maximum sum in a path from (0, 0) to (N-1, M-1) when can only move to right or down"
   }
 }
diff --git a/algorithm/etc/dp/max_sum_path/code.js b/algorithm/etc/dp/max_sum_path/code.js
@@ -0,0 +1,32 @@
+tracer._print('values = [');
+for (var i = 0; i < D.length; i++) {
+    tracer._print('&nbsp;&nbsp;&nbsp;&nbsp;[' + D[i].join(', ') + ']');
+}
+tracer._print(']');
+tracer._pace(200);
+var N = DP.length;
+var M = DP[0].length;
+for (var i = 0; i < N; i++) {
+    for (var j = 0; j < M; j++) {
+        tracer._sleep();
+        if (i == 0 && j == 0) {
+            tracer._select(i, j);
+            DP[i][j] = D[i][j];
+            tracer._deselect(i, j);
+        } else if (i == 0) {
+            tracer._select(i, j - 1);
+            DP[i][j] = DP[i][j - 1] + D[i][j];
+            tracer._deselect(i, j - 1);
+        } else if (j == 0) {
+            tracer._select(i - 1, j);
+            DP[i][j] = DP[i - 1][j] + D[i][j];
+            tracer._deselect(i - 1, j);
+        } else {
+            tracer._selectSet([{x: i, y: j - 1}, {x: i - 1, y: j}]);
+            DP[i][j] = Math.max(DP[i][j - 1], DP[i - 1][j]) + D[i][j];
+            tracer._deselectSet([{x: i, y: j - 1}, {x: i - 1, y: j}]);
+        }
+        tracer._notify(i, j);
+    }
+}
+tracer._print('max = ' + DP[N - 1][M - 1]);
diff --git a/algorithm/etc/dp/max_sum_path/data.js b/algorithm/etc/dp/max_sum_path/data.js
@@ -0,0 +1,10 @@
+var tracer = new Array2DTracer();
+var D = Array2D.createRandomData(5, 5, 1, 5);
+var DP = [];
+for (var i = 0; i < D.length; i++) {
+    DP.push([]);
+    for (var j = 0; j < D[i].length; j++) {
+        DP[i].push(999);
+    }
+}
+tracer.setData(DP);
diff --git a/algorithm/etc/dp/sliding_window/data.js b/algorithm/etc/dp/sliding_window/data.js
@@ -1,3 +1,3 @@
 var tracer = new Array1DTracer();
-var D = tracer.createRandomData(20, -5, 5);
+var D = Array1D.createRandomData(20, -5, 5);
 tracer.setData(D);
diff --git a/algorithm/graph_search/dfs/all_paths/data.js b/algorithm/graph_search/dfs/all_paths/data.js
@@ -6,5 +6,5 @@ var tracer = new GraphTracer();
  [0, 0, 0, 0, 1],
  [0, 0, 0, 0, 0]
  ];*/
-var G = tracer.createRandomData(5, .75);
+var G = Graph.createRandomData(5, .75);
 tracer.setData(G);
diff --git a/algorithm/graph_search/dfs/shortest_path/data.js b/algorithm/graph_search/dfs/shortest_path/data.js
@@ -6,5 +6,5 @@ var tracer = new WeightedGraphTracer();
  [0, 2, 0, 0, 1],
  [0, 1, 3, 0, 0]
  ];*/
-var G = tracer.createRandomData(10, .3, 1, 9);
+var G = WeightedGraph.createRandomData(10, .3, 1, 9);
 tracer.setData(G);
diff --git a/algorithm/graph_search/dfs/weighted_graph/data.js b/algorithm/graph_search/dfs/weighted_graph/data.js
@@ -6,5 +6,5 @@ var tracer = new WeightedGraphTracer();
  [0, 2, 0, 0, 1],
  [0, 1, 3, 0, 0]
  ];*/
-var G = tracer.createRandomData(5, .5);
+var G = WeightedGraph.createRandomData(5, .5);
 tracer.setData(G);
diff --git a/algorithm/sorting/bubble/basic/data.js b/algorithm/sorting/bubble/basic/data.js
@@ -1,3 +1,3 @@
 var tracer = new Array1DTracer();
-var D = tracer.createRandomData(15);
+var D = Array1D.createRandomData(15);
 tracer.setData(D);
diff --git a/algorithm/sorting/insertion/basic/data.js b/algorithm/sorting/insertion/basic/data.js
@@ -1,3 +1,3 @@
 var tracer = new Array1DTracer();
-var D = tracer.createRandomData(15);
+var D = Array1D.createRandomData(15);
 tracer.setData(D);
diff --git a/algorithm/sorting/quick/basic/data.js b/algorithm/sorting/quick/basic/data.js
@@ -1,3 +1,3 @@
 var tracer = new Array1DTracer();
-var D = tracer.createRandomData(15);
+var D = Array1D.createRandomData(15);
 tracer.setData(D);
diff --git a/algorithm/sorting/selection/basic/data.js b/algorithm/sorting/selection/basic/data.js
@@ -1,3 +1,3 @@
 var tracer = new Array1DTracer();
-var D = tracer.createRandomData(15);
+var D = Array1D.createRandomData(15);
 tracer.setData(D);
diff --git a/js/module/array1d.js b/js/module/array1d.js
@@ -5,9 +5,10 @@ function Array1DTracer(module) {
 Array1DTracer.prototype = Object.create(Array2DTracer.prototype);
 Array1DTracer.prototype.constructor = Array1DTracer;
 
-// Override
-Array1DTracer.prototype.createRandomData = function (N, min, max) {
-    return Array2DTracer.prototype.createRandomData.call(this, 1, N, min, max)[0];
+var Array1D = {
+    createRandomData: function (N, min, max) {
+        return Array2D.createRandomData(1, N, min, max)[0];
+    }
 };
 
 // Override
diff --git a/js/module/array2d.js b/js/module/array2d.js
@@ -25,19 +25,21 @@ Array2DTracer.prototype.clear = function () {
     clearTableColor();
 };
 
-Array2DTracer.prototype.createRandomData = function (N, M, min, max) {
-    if (!N) N = 10;
-    if (!M) M = 10;
-    if (min === undefined) min = 1;
-    if (max === undefined) max = 9;
-    var D = [];
-    for (var i = 0; i < N; i++) {
-        D.push([]);
-        for (var j = 0; j < M; j++) {
-            D[i].push((Math.random() * (max - min + 1) | 0) + min);
+var Array2D = {
+    createRandomData: function (N, M, min, max) {
+        if (!N) N = 10;
+        if (!M) M = 10;
+        if (min === undefined) min = 1;
+        if (max === undefined) max = 9;
+        var D = [];
+        for (var i = 0; i < N; i++) {
+            D.push([]);
+            for (var j = 0; j < M; j++) {
+                D[i].push((Math.random() * (max - min + 1) | 0) + min);
+            }
         }
+        return D;
     }
-    return D;
 };
 
 // Override
diff --git a/js/module/graph.js b/js/module/graph.js
@@ -25,19 +25,20 @@ GraphTracer.prototype.clear = function () {
     clearGraphColor();
 };
 
-// Override
-GraphTracer.prototype.createRandomData = function (N, ratio) {
-    if (!N) N = 5;
-    if (!ratio) ratio = .3;
-    var G = [];
-    for (var i = 0; i < N; i++) {
-        G.push([]);
-        for (var j = 0; j < N; j++) {
-            if (i == j) G[i].push(0);
-            else G[i].push((Math.random() * (1 / ratio) | 0) == 0 ? 1 : 0);
+var Graph = {
+    createRandomData: function (N, ratio) {
+        if (!N) N = 5;
+        if (!ratio) ratio = .3;
+        var G = [];
+        for (var i = 0; i < N; i++) {
+            G.push([]);
+            for (var j = 0; j < N; j++) {
+                if (i == j) G[i].push(0);
+                else G[i].push((Math.random() * (1 / ratio) | 0) == 0 ? 1 : 0);
+            }
         }
+        return G;
     }
-    return G;
 };
 
 GraphTracer.prototype.setTreeData = function (G, root) {
@@ -85,7 +86,7 @@ GraphTracer.prototype.setTreeData = function (G, root) {
 // Override
 GraphTracer.prototype.setData = function (G) {
     if (Tracer.prototype.setData.call(this, arguments)) return true;
-    
+
     graph.clear();
     var nodes = [];
     var edges = [];
diff --git a/js/module/weighted_graph.js b/js/module/weighted_graph.js
@@ -16,25 +16,26 @@ WeightedGraphTracer.prototype.clear = function () {
     clearWeights();
 };
 
-// Override
-WeightedGraphTracer.prototype.createRandomData = function (N, ratio, min, max) {
-    if (!N) N = 5;
-    if (!ratio) ratio = .3;
-    if (!min) min = 1;
-    if (!max) max = 5;
-    var G = [];
-    for (var i = 0; i < N; i++) {
-        G.push([]);
-        for (var j = 0; j < N; j++) {
-            if (i == j) G[i].push(0);
-            else if ((Math.random() * (1 / ratio) | 0) == 0) {
-                G[i].push((Math.random() * (max - min + 1) | 0) + min);
-            } else {
-                G[i].push(0);
+var WeightedGraph = {
+    createRandomData: function (N, ratio, min, max) {
+        if (!N) N = 5;
+        if (!ratio) ratio = .3;
+        if (!min) min = 1;
+        if (!max) max = 5;
+        var G = [];
+        for (var i = 0; i < N; i++) {
+            G.push([]);
+            for (var j = 0; j < N; j++) {
+                if (i == j) G[i].push(0);
+                else if ((Math.random() * (1 / ratio) | 0) == 0) {
+                    G[i].push((Math.random() * (max - min + 1) | 0) + min);
+                } else {
+                    G[i].push(0);
+                }
             }
         }
+        return G;
     }
-    return G;
 };
 
 // Override

Original file line number	Diff line number	Diff line change
`@@ -10,6 +10,7 @@`
`10`	`10`	`],`
`11`	`11`	`"files": {`
`12`	`12`	`"fibonacci": "Fibonacci Sequence",`
`13`		`- "sliding_window": "Finding the largest sum of three contiguous number"`
	`13`	`+ "sliding_window": "Finding the largest sum of three contiguous number",`
	`14`	`+ "max_sum_path": "Finding the maximum sum in a path from (0, 0) to (N-1, M-1) when can only move to right or down"`
`14`	`15`	`}`
`15`	`16`	`}`