Merge remote-tracking branch 'upstream/gh-pages'

duaraghav8@gmail · duaraghav8@gmail · commit 5cd7f9cd0a90 · 2016-05-25T13:12:20.000+05:30
diff --git a/algorithm/category.json b/algorithm/category.json
@@ -13,7 +13,8 @@
   "mst": {
     "name": "Minimum Spanning Tree",
     "list": {
-      "prim": "Prim's Algorithm"
+      "prim": "Prim's Algorithm",
+      "kruskal": "Kruskal's Algorithm"
     }
   },
   "search": {
diff --git a/algorithm/mst/kruskal/desc.json b/algorithm/mst/kruskal/desc.json
@@ -0,0 +1,14 @@
+{
+  "Kruskal's Algorithm": "Greedy algorithm that finds a minimum spanning tree for a weighted undirected graph.",
+  "Applications": [
+  ],
+  "Complexity": {
+    "time": "worst O(E log(E))"
+  },
+  "References": [
+    "<a href='https://en.wikipedia.org/wiki/Kruskal%27s_algorithm'>Wikipedia</a>"
+  ],
+  "files": {
+    "normal": "Finds minimum spanning tree of a given graph."
+  }
+}
diff --git a/algorithm/mst/kruskal/normal/code.js b/algorithm/mst/kruskal/normal/code.js
@@ -0,0 +1,51 @@
+function kruskal() {
+    var vcount = G.length;
+
+    // Preprocess: sort edges by weight.
+    var edges = [];
+    for (var vi = 0; vi < vcount - 1; vi++) {
+        for (var vj = vi + 1; vj < vcount; vj++) {
+            edges.push({
+                0: vi,
+                1: vj,
+                weight: G[vi][vj]
+            });
+        }
+    }
+    edges.sort(function (ei, ej) {
+        return ei.weight - ej.weight
+    });
+
+    // Give each vertex a tree to decide if they are already in the same tree.
+    var t = [];
+    for (var i = 0; i < vcount; i++) {
+        t[i] = {};
+        t[i][i] = true;
+    }
+
+    var wsum = 0;
+    for (var n = 0; n < vcount - 1 && edges.length > 0;) {
+        var e = edges.shift(); // Get the edge of min weight
+        tracer._visit(e[0], e[1])._wait();
+        if (t[e[0]] === t[e[1]]) {
+            // e[0] & e[1] already in the same tree, ignore
+            tracer._leave(e[0], e[1])._wait();
+            continue;
+        }
+
+        // Choose the current edge.
+        wsum += e.weight;
+
+        // Merge tree of e[0] & e[1]
+        var tmerged = {};
+        for (i in t[e[0]]) tmerged[i] = true;
+        for (i in t[e[1]]) tmerged[i] = true;
+        for (i in tmerged) t[i] = tmerged;
+
+        n += 1;
+    }
+
+    logger._print("The sum of all edges is: " + wsum);
+}
+
+kruskal();
diff --git a/algorithm/mst/kruskal/normal/data.js b/algorithm/mst/kruskal/normal/data.js
@@ -0,0 +1,11 @@
+var tracer = new WeightedUndirectedGraphTracer();
+var logger = new LogTracer();
+/*var G = [ // G[i][j] indicates the weight of the path from the i-th node to the j-th node
+ [0, 3, 0, 1, 0],
+ [5, 0, 1, 2, 4],
+ [1, 0, 0, 2, 0],
+ [0, 2, 0, 0, 1],
+ [0, 1, 3, 0, 0]
+ ];*/
+var G = WeightedUndirectedGraph.random(5, 1, 1, 9);
+tracer._setData(G);
diff --git a/js/module/array2d.js b/js/module/array2d.js
@@ -12,33 +12,20 @@ Array2DTracer.prototype = $.extend(true, Object.create(Tracer.prototype), {
         this.$table = this.capsule.$table = $('<div class="mtbl-table">');
         this.$container.append(this.$table);
     },
-    _notify: function (x1, y1, v1, x2, y2, v2) {
-        var second = x2 !== undefined && y2 !== undefined;
+    _notify: function (x, y, v) {
         tm.pushStep(this.capsule, {
             type: 'notify',
-            x: x1,
-            y: y1,
-            v: v1
-        }, !second);
-        if (second) tm.pushStep(this.capsule, {
-            type: 'notify',
-            x: x2,
-            y: y2,
-            v: v2
+            x: x,
+            y: y,
+            v: v
         });
         return this;
     },
-    _denotify: function (x1, y1, x2, y2) {
-        var second = x2 !== undefined && y2 !== undefined;
+    _denotify: function (x, y) {
         tm.pushStep(this.capsule, {
             type: 'denotify',
-            x: x1,
-            y: y1
-        });
-        if (second) tm.pushStep(this.capsule, {
-            type: 'denotify',
-            x: x2,
-            y: y2
+            x: x,
+            y: y
         });
         return this;
     },
diff --git a/js/module/tracer_manager.js b/js/module/tracer_manager.js
@@ -153,7 +153,6 @@ TracerManager.prototype = {
         this.step(this.traceIndex + 1);
     },
     visualize: function () {
-        $('#btn_trace').click();
         this.traceIndex = -1;
         this.resumeStep();
     },
diff --git a/js/script.js b/js/script.js
@@ -39,7 +39,6 @@ dataEditor.on('change', function () {
         tm.deallocateAll();
         eval(data);
     } catch (err) {
-        console.error(err);
     } finally {
         tm.visualize();
         tm.removeUnallocated();
@@ -215,6 +214,7 @@ var showInfoToast = function (info) {
 };
 
 $('#btn_run').click(function () {
+    $('#btn_trace').click();
     try {
         tm.deallocateAll();
         eval(dataEditor.getValue());
