bellman_ford: update weight of each node

Author: 64json

algorithm/graph_search/bellman_ford/shortest_path/code.js

@@ -3,8 +3,10 @@ function BELLMAN_FORD (src, dest) {
 
 	for (var i = 0; i < G.length; i++) {
 		weights [i] = MAX_VALUE;
+        tracer._weight(i, weights[i]);
 	}
 	weights [src] = 0;
+    tracer._weight(src, 0);
 
 	tracer._print ('Initializing weights to: [' +  weights + ']');
 	tracer._print ('');
@@ -19,14 +21,13 @@ function BELLMAN_FORD (src, dest) {
 			for (var currentNodeNeighbor = 0; currentNodeNeighbor <= G.length; currentNodeNeighbor++) {
 				if (G [currentNode] [currentNodeNeighbor]) {	//proceed to relax Edges only if a particular weight != 0 (0 represents no edge)
 					tracer._print ('Exploring edge from ' + currentNode + ' to ' + currentNodeNeighbor + ', weight = ' + G [currentNode] [currentNodeNeighbor]);
-					tracer._visit (currentNodeNeighbor, currentNode, undefined);
 
 					if ( weights [currentNodeNeighbor] > (weights [currentNode] + G [currentNode] [currentNodeNeighbor]) ) {
 						weights [currentNodeNeighbor] = weights [currentNode] + G [currentNode] [currentNodeNeighbor];
 						tracer._print ('weights [' + currentNodeNeighbor + '] = weights [' + currentNode + '] + ' + G [currentNode] [currentNodeNeighbor]);
 					}
-
-					tracer._leave (currentNodeNeighbor, currentNode, undefined);
+                    tracer._visit (currentNodeNeighbor, currentNode, weights [currentNodeNeighbor]);
+					tracer._leave (currentNodeNeighbor, currentNode);
 				}
 			}
 		}