This repository has been archived by the owner on Feb 5, 2022. It is now read-only.

Implement Bellman-Ford algorithm #3

Open

adrobisch opened this issue Apr 8, 2018 · 0 comments

Labels

Contributor

adrobisch commented Apr 8, 2018

As alternative to Dijkstras shortes paths, graphs should support https://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algorithm to support negative edge weights.

adrobisch added the algorithms label

Sign up for free to subscribe to this conversation on GitHub. Already have an account? Sign in.