graph-paths
v0.4.0
Published
Finding shortest / cheapest paths in a dense graph
Downloads
1,868
Readme
graph-paths
Finding cheapest (shortest) paths in a dense graph (network).
The graph is given by a matrix of direct costs between each two nodes in the network.
See example.js for an example.