From 9c165fd226c55e47d393909ea21883b0d3d5e9df Mon Sep 17 00:00:00 2001
From: Curran <curran.kelleher@gmail.com>
Date: Fri, 23 Mar 2018 12:37:00 +0530
Subject: [PATCH] Shortest Path Weight. Closes #17

---
 index.js |  3 +++
 test.js  | 16 +++++++++++-----
 2 files changed, 14 insertions(+), 5 deletions(-)

diff --git a/index.js b/index.js
index 0339574..785d715 100644
--- a/index.js
+++ b/index.js
@@ -276,9 +276,11 @@ module.exports = function Graph(serialized){
     // predecessor subgraph from destination to source.
     function path(){
       var nodeList = [];
+      var weight = 0;
       var node = destination;
       while(p[node]){
         nodeList.push(node);
+        weight += getEdgeWeight(p[node], node);
         node = p[node];
       }
       if (node !== source) {
@@ -286,6 +288,7 @@ module.exports = function Graph(serialized){
       }
       nodeList.push(node);
       nodeList.reverse();
+      nodeList.weight = weight;
       return nodeList;
     }
 
diff --git a/test.js b/test.js
index b637754..f41f3a2 100644
--- a/test.js
+++ b/test.js
@@ -17,6 +17,11 @@ function output(graph, name){
   outputGraph(graph.serialize(), name);
 }
 
+function withWeight(nodeList, weight){
+  nodeList.weight = weight;
+  return nodeList;
+}
+
 describe("Graph", function() {
 
   describe("Data structure", function() {
@@ -337,14 +342,14 @@ describe("Graph", function() {
 
     it("Should compute shortest path on a single edge.", function (){
       var graph = Graph().addEdge("a", "b");
-      assert.deepEqual(graph.shortestPath("a", "b"), ["a", "b"]);
+      assert.deepEqual(graph.shortestPath("a", "b"), withWeight(["a", "b"], 1));
     });
 
     it("Should compute shortest path on two edges.", function (){
       var graph = Graph()
         .addEdge("a", "b")
         .addEdge("b", "c");
-      assert.deepEqual(graph.shortestPath("a", "c"), ["a", "b", "c"]);
+      assert.deepEqual(graph.shortestPath("a", "c"), withWeight(["a", "b", "c"], 2));
     });
 
     it("Should compute shortest path on example from Cormen text (p. 659).", function (){
@@ -358,8 +363,9 @@ describe("Graph", function() {
         .addEdge("y", "z", 2)
         .addEdge("x", "z", 4)
         .addEdge("z", "x", 6);
-      assert.deepEqual(graph.shortestPath("s", "z"), ["s", "y", "z"]);
-      assert.deepEqual(graph.shortestPath("s", "x"), ["s", "y", "t", "x"]);
+
+      assert.deepEqual(graph.shortestPath("s", "z"), withWeight(["s", "y", "z"], 5 + 2));
+      assert.deepEqual(graph.shortestPath("s", "x"), withWeight(["s", "y", "t", "x"], 5 + 3 + 1));
     });
 
     it("Should throw error if source node not in graph.", function (){
@@ -384,7 +390,7 @@ describe("Graph", function() {
         .addEdge("a", "b")
         .addEdge("b", "c")
         .addEdge("d", "e");
-      assert.deepEqual(graph.shortestPath("a", "c"), ["a", "b", "c"]);
+      assert.deepEqual(graph.shortestPath("a", "c"), withWeight(["a", "b", "c"], 2));
     });
   });
 });