Algorithm for finding shortest paths in a weighted graph with positive or negative edge weights (but with no negative cycles)
npm install ml-floyd-warshall[![NPM version][npm-image]][npm-url]
[![build status][ci-image]][ci-url]
[![npm download][download-image]][download-url]
Algorithm for finding shortest paths in a weighted graph with positive or negative edge weights (but with no negative cycles).
$ npm i ml-floyd-warshall
[npm-image]: https://img.shields.io/npm/v/ml-floyd-warshall.svg
[npm-url]: https://npmjs.org/package/ml-floyd-warshall
[ci-image]: https://github.com/mljs/floyd-warshall/workflows/Node.js%20CI/badge.svg?branch=main
[ci-url]: https://github.com/mljs/floyd-warshall/actions?query=workflow%3A%22Node.js+CI%22
[download-image]: https://img.shields.io/npm/dm/ml-floyd-warshall.svg
[download-url]: https://npmjs.org/package/ml-floyd-warshall