https://github.com/mljs/floyd-warshall
Algorithm for finding shortest paths in a weighted graph with positive or negative edge weights (but with no negative cycles)
https://github.com/mljs/floyd-warshall
Last synced: 2 months ago
JSON representation
Algorithm for finding shortest paths in a weighted graph with positive or negative edge weights (but with no negative cycles)
- Host: GitHub
- URL: https://github.com/mljs/floyd-warshall
- Owner: mljs
- License: mit
- Created: 2016-08-30T09:15:30.000Z (almost 9 years ago)
- Default Branch: main
- Last Pushed: 2023-02-27T15:23:41.000Z (over 2 years ago)
- Last Synced: 2025-04-13T01:18:37.889Z (2 months ago)
- Language: TypeScript
- Homepage:
- Size: 1.18 MB
- Stars: 4
- Watchers: 10
- Forks: 4
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- Changelog: CHANGELOG.md
- License: LICENSE
Awesome Lists containing this project
README
# 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).
## Installation
`$ npm i ml-floyd-warshall`
## [API Documentation](https://mljs.github.io/floyd-warshall/)
## License
[MIT](./LICENSE)
[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