js-graph-algorithms
Advanced tools
Comparing version 1.0.11 to 1.0.13
{ | ||
"name": "js-graph-algorithms", | ||
"version": "1.0.11", | ||
"version": "1.0.13", | ||
"description": "Package implements data structures and algorithms for processing various types of graphs", | ||
@@ -11,2 +11,3 @@ "author": "Xianshun Chen", | ||
"main": "index.js", | ||
"typings": "src/jsgraphs.d.ts", | ||
"directories": { | ||
@@ -13,0 +14,0 @@ "test": "test" |
@@ -14,3 +14,3 @@ # js-graph-algorithms | ||
* Minimum Spanning Tree for weighted graph (Kruskal, Prim Lazy, Prim Eager) (Link: [HTML DEMO](https://rawgit.com/chen0040/js-graph-algorithms/master/examples/example-kruskal.html)) | ||
* Shortest Paths (Dijkstra, Bellman-Ford, Topological Sort on DAG) (Link: [HTML DEMO](https://rawgit.com/chen0040/js-graph-algorithms/master/examples/example-dijstra.html)) | ||
* Shortest Paths (Dijkstra, Bellman-Ford, Topological Sort on DAG) (Link: [HTML DEMO](https://rawgit.com/chen0040/js-graph-algorithms/master/examples/example-dijkstra.html)) | ||
* MaxFlow-MinCut (Ford-Fulkerson) (Link: [HTML DEMO](https://rawgit.com/chen0040/js-graph-algorithms/master/examples/example-ford-fulkerson.html)) | ||
@@ -382,3 +382,3 @@ | ||
The sample code below show how to obtain the shortest paths from a starting point 0 on a weighted directed graph using Dijkstra (Link: [HTML DEMO](https://rawgit.com/chen0040/js-graph-algorithms/master/examples/example-dijstra.html)): | ||
The sample code below show how to obtain the shortest paths from a starting point 0 on a weighted directed graph using Dijkstra (Link: [HTML DEMO](https://rawgit.com/chen0040/js-graph-algorithms/master/examples/example-dijkstra.html)): | ||
@@ -385,0 +385,0 @@ ```javascript |
@@ -23,2 +23,5 @@ var expect = require('chai').expect; | ||
g.node(2).label = 'Hello'; | ||
g.edge(0, 1).label = 'World'; | ||
var source = 0; | ||
@@ -25,0 +28,0 @@ var target = 7; |
Sorry, the diff of this file is not supported yet
7404441
71
54682