Algorithm for finding shortest paths in a weighted graph with positive or negative edge weights (but with no negative cycles). 

Algorithm for finding shortest paths in a weighted graph with positive or negative edge weights (but with no negative cycles)

targos

jeffersonh44

lpatiny

maasencioh

stropitek

mljs-bot

andcastillo

ml-floyd-warshall

### Bug Fixes

* correct prepack script ([70ef3db](https://github.com/mljs/floyd-warshall/commit/70ef3db13eca7b1eadcffa09ca01045d18c6ad62))

[3.0.1](https://github.com/mljs/floyd-warshall/compare/v3.0.0...v3.0.1) (2023-02-27)

### Bug Fixes

* prepack ([94eb955](https://github.com/mljs/floyd-warshall/commit/94eb95534a8a2ee15373b9f196bb750e77a6d2f5))

[2.0.1](https://github.com/mljs/floyd-warshall/compare/v2.0.0...v2.0.1) (2022-11-22)

### Bug Fixes

* differentiates between negative zero ([#7](https://github.com/mljs/floyd-warshall/issues/7)) ([479d032](https://github.com/mljs/floyd-warshall/commit/479d032574b297807015ed0d44efeb41b7d663ee))

[1.0.4](https://github.com/mljs/floyd-warshall/compare/v1.0.3...v1.0.4) (2022-02-28)

### Bug Fixes

* build in lib ([8bf7dcd](https://github.com/mljs/floyd-warshall/commit/8bf7dcdb372f8b47d82700549b9ab588e47b2e9d))

[1.0.3](https://github.com/mljs/floyd-warshall/compare/v1.0.2...v1.0.3) (2020-01-23)

[1.0.2](https://github.com/mljs/floyd-warshall/compare/v1.0.1...v1.0.2) (2020-01-23)

[1.0.1](https://github.com/mljs/floyd-warshall/compare/v1.0.0...v1.0.1) (2020-01-21)

### Features

* initial implementation of Floyd Warshall ([42ca7aa](https://github.com/mljs/floyd-warshall/commit/42ca7aa))

3.0.1

3.0.1 (2023-02-27)

Bug Fixes

2.0.1

2.0.1 (2022-11-22)

Bug Fixes

1.0.4

1.0.4 (2022-02-28)

Bug Fixes

1.0.3

1.0.3 (2020-01-23)

Bug Fixes

1.0.2

1.0.2 (2020-01-23)

1.0.1

1.0.1 (2020-01-21)

1.0.0

1.0.0 (2016-08-30)

Features