Add Bellman-Ford

Open ybrenning opened this issue 3 years ago • 2 comments

Add bellman_ford.jl to demonstrate the Bellman-Ford algorithm for finding the shortest paths in a weighted graph, an alternative to the already implemented Dijkstra's algorithm which would allow for negative edge weights.

Sep 06 '22 17:09 ybrenning

Hey there! Great suggestion; thank you! Would you like to work on this? 🙂

Sep 06 '22 18:09 Panquesito7

I'm on it :thumbsup:

Sep 06 '22 21:09 ybrenning