graph-paths

Finding shortest / cheapest paths in a dense graph

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.