Finding shortest / cheapest paths in a dense graph
Want to see pretty graphs? Log in now!
npm install graph-paths
|2||downloads in the last week|
|24||downloads in the last month|
|Last Published By|
|Version||0.4.0 last updated 8 months ago|
|Keywords||graph, paths, matrix|
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 = [ [0,1,7,20], [Infinity,0,4,19], [Infinity,Infinity,0,7], [Infinity,Infinity,Infinity,0], ]; var cheapest_paths_from_0 = cheapest_paths(costs, 0); console.log("cheapest paths from node #0 to all other nodes:"); console.dir(cheapest_paths_from_0); console.log("cheapest path from node #0 to node #3:"); console.dir(cheapest_paths_from_0.path);