Finding shortest / cheapest paths in a dense graph

npm install graph-paths
2 downloads in the last week
24 downloads in the last month

graph-paths is a small module for finding cheapest (shortest) paths in a dense graph (network).


$ npm install graph-paths


var cheapest_paths = require('graph-paths').cheapest_paths;

 * The network is defined by a matrix describing the cost of getting from node i to node j.
 * If there is no way from node i to node j, then the cost is infinite.
var costs = [

var cheapest_paths_from_0 = cheapest_paths(costs, 0);
console.log("cheapest paths from node #0 to all other nodes:");

console.log("cheapest path from node #0 to node #3:");
npm loves you