Rename w to edge in weighted graphs

Author: awpala

javascript/graph-algorithms/p634_Prim.js

@@ -55,7 +55,7 @@ const PrimMST = (G, r) => {
         const adj = u.adjacentVertices;
         for (let vertex in adj) {
             const v = G.V[vertex];
-            const w = adj[vertex].w.weight;
+            const w = adj[vertex].edge.weight;
             if((v.color === 'WHITE') && (w < v.key)) {
                 v.pi = u;
                 Q.decreaseKey(v, w)

javascript/graph-algorithms/p658_Dijkstra.js

@@ -45,7 +45,7 @@ const dijkstra = (G, s) => {
         const adj = u.adjacentVertices;
         for (let vertex in adj) {
             const v = G.V[vertex];
-            const w = adj[vertex].w.weight;
+            const w = adj[vertex].edge.weight;
             relax(u, v, w);
         }
     }

javascript/utilities.js

@@ -129,10 +129,10 @@ class WeightedGraph {
         });
 
         this.V[u.name].adjacentVertices[v.name] = { 
-            w: this.E[this.E.length - 1]
+            edge: this.E[this.E.length - 1]
         };
         this.V[v.name].adjacentVertices[u.name] = {
-            w: this.E[this.E.length - 1]
+            edge: this.E[this.E.length - 1]
         };
     }
 
@@ -149,7 +149,7 @@ class WeightedGraph {
         });
 
         this.V[u.key].adjacentVertices[v.key] = { 
-            w: this.E[this.E.length - 1]
+            edge: this.E[this.E.length - 1]
         };
     }
 }