npm deployed

Author: chen0040

README.md

@@ -355,4 +355,52 @@ for(var i=0; i < mst.length; ++i) {
     var w = e.other(v);
     console.log('(' + v + ', ' + w + '): ' + e.weight);
 }
+```
+
+### find the shortest paths using Dijkstra on weighted directed graph
+
+The sample code below show how to obtain the shortest paths from a starting point 0 on a weighted directed graph using Dijkstra:
+
+```javascript
+var jsgraphs = require('js-graph-algorithms');
+var g = new jsgraphs.WeightedDiGraph(8);
+g.addEdge(new jsgraphs.Edge(0, 1, 5.0));
+g.addEdge(new jsgraphs.Edge(0, 4, 9.0));
+g.addEdge(new jsgraphs.Edge(0, 7, 8.0));
+g.addEdge(new jsgraphs.Edge(1, 2, 12.0));
+g.addEdge(new jsgraphs.Edge(1, 3, 15.0));
+g.addEdge(new jsgraphs.Edge(1, 7, 4.0));
+g.addEdge(new jsgraphs.Edge(2, 3, 3.0));
+g.addEdge(new jsgraphs.Edge(2, 6, 11.0));
+g.addEdge(new jsgraphs.Edge(3, 6, 9.0));
+g.addEdge(new jsgraphs.Edge(4, 5, 5.0));
+g.addEdge(new jsgraphs.Edge(4, 6, 20.0));
+g.addEdge(new jsgraphs.Edge(4, 7, 5.0));
+g.addEdge(new jsgraphs.Edge(5, 2, 1.0));
+g.addEdge(new jsgraphs.Edge(5, 6, 13.0));
+g.addEdge(new jsgraphs.Edge(7, 5, 6.0));
+g.addEdge(new jsgraphs.Edge(7, 2, 7.0));  
+
+expect(g.V).to.equal(8);
+var edgeCount = 0;
+for(var v = 0; v < g.V; ++v){
+    var adj_v = g.adj(v);
+    edgeCount += adj_v.length;
+}
+expect(edgeCount).to.equal(16);
+
+var dijkstra = new jsgraphs.Dijkstra(g, 0);
+
+for(var v = 1; v < g.V; ++v){
+    if(dijkstra.hasPathTo(v)){
+        var path = dijkstra.pathTo(v);
+        console.log('=====path from 0 to ' + v + ' start==========');
+        for(var i = 0; i < path.length; ++i) {
+            var e = path[i];
+            console.log(e.from() + ' => ' + e.to() + ': ' + e.weight);
+        }
+        console.log('=====path from 0 to ' + v + ' end==========');
+        console.log('=====distance: '  + dijkstra.distanceTo(v) + '=========');
+    }
+}
 ```

package.json

@@ -1,6 +1,6 @@
 {
   "name": "js-graph-algorithms",
-  "version": "1.0.5",
+  "version": "1.0.6",
   "description": "Package implements data structures and algorithms for processing various types of graphs",
   "author": "Xianshun Chen",
   "contributors": [