The technology of today is all about fast data transfer with as less effort and time as possible. We strive to make programs that are as responsive as possible and make for a great end-user experience. Imagine you having a bunch of computer servers and would like to know which one is the closest, what route to take to get to each and every one of them the fastest and cheapest way possible. How can we accomplish this? Introducing the Bellman-Ford (Sometimes also called Bellman-Ford-Moore) algorithm. Similar to Dijkstra’s algorithm, it calculates the shortest path from a source vertex to all the other vertices in a weighted, directional graph. It runs slower than Dijsktra, but it’s more versatile, as it enables negative cycle detection.
Project homepage at github: https://github.com/1nfused/Bellman-Ford-algorithm