This repository was archived by the owner on Feb 5, 2022. It is now read-only.
This repository was archived by the owner on Feb 5, 2022. It is now read-only.
Implement Bellman-Ford algorithm #3
Description
As alternative to Dijkstras shortes paths, graphs should support https://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algorithm to support negative edge weights.