Merge pull request algorithm-visualizer#103 from TornjV/fix/dijkstra-visualization

TornjV · TornjV · commit 5ca8a0a142c8 · 2016-05-28T10:40:56.000+02:00
Fix visualization
diff --git a/algorithm/graph_search/dijkstra/shortest_path/code.js b/algorithm/graph_search/dijkstra/shortest_path/code.js
@@ -3,21 +3,20 @@ function Dijkstra(start, end) {
     var D = []; // D[i] indicates whether the i-th node is discovered or not
     for (var i = 0; i < G.length; i++) D.push(false);
     S[start] = 0; // Starting node is at distance 0 from itself
+    tracerS._notify(start, S[start]);
     var k = G.length;
     while (k--) {
         // Finding a node with the shortest distance from S[minIndex]
         minDistance = MAX_VALUE;
         for (i = 0; i < G.length; i++) {
-            tracerS._select(i)._wait();
             if (S[i] < minDistance && !D[i]) {
                 minDistance = S[i];
                 minIndex = i;
             }
-            tracerS._deselect(i);
         }
         if (minDistance == MAX_VALUE) break; // If there is no edge from current node, jump out of loop
         D[minIndex] = true;
-        tracerS._notify(minIndex, S[minIndex])._denotify(minIndex);
+        tracerS._notify(minIndex);
         tracer._visit(minIndex)._wait();
         // For every unvisited neighbour of current node, we check
         // whether the path to it is shorter if going over the current node
