shortest path algorithm

Author: loiane

chapter09/03-ShortestPath.js

@@ -25,28 +25,19 @@ function ShortestPath(graph) {
             visited = [],
             length = this.graph.length;
 
-        // Initialize all distances as INFINITE (JavaScript max number) and visited[] as false
         for (var i = 0; i < length; i++) {
             dist[i] = INF;
             visited[i] = false;
         }
 
-        // Distance of source vertex from itself is always 0
         dist[src] = 0;
 
-        // Find shortest path for all vertices
         for (var i = 0; i < length-1; i++){
 
-            // Pick the minimum distance vertex from the set of vertices
-            // not yet processed. u is always equal to src in first
-            // iteration.
             var u = minDistance(dist, visited);
 
-            // Mark the picked vertex as processed
             visited[u] = true;
 
-            // Update dist value of the adjacent vertices of the
-            // picked vertex.
             for (var v = 0; v < length; v++){
                 if (!visited[v] && this.graph[u][v]!=0 && dist[u] != INF && dist[u]+this.graph[u][v] < dist[v]){
                     dist[v] = dist[u] + this.graph[u][v];