[x] Have you followed the guidelines in our Readme.md document?
[x] Have you checked to ensure there aren't other open Pull Requests for the same update/change?
[x] Have you created tests for your algorithm?
If you can check all of the above, congrats! :sparkles:
Description:
The Bellman–Ford algorithm is an algorithm that computes shortest paths from a single source vertex to all of the other vertices in a weighted digraph. It is slower than Dijkstra's algorithm for the same problem, but more versatile, as it is capable of handling graphs in which some of the edge weights are negative numbers.
Note: Description taken directly from wikipedia, as I did not make any special changes that would divert the algorithm from its original form.
Tests include 3 cases: graph with only positive edges, graph with negative edges and graph with negative circle.
Enter Id of issue here.
If you can check all of the above, congrats! :sparkles:
Description:
The Bellman–Ford algorithm is an algorithm that computes shortest paths from a single source vertex to all of the other vertices in a weighted digraph. It is slower than Dijkstra's algorithm for the same problem, but more versatile, as it is capable of handling graphs in which some of the edge weights are negative numbers.
Note: Description taken directly from wikipedia, as I did not make any special changes that would divert the algorithm from its original form.
Tests include 3 cases: graph with only positive edges, graph with negative edges and graph with negative circle.