The repository currently covers shortest paths using Dijkstra's Algorithm, which fails on graphs containing negative edge weights. To complete the set of fundamental shortest-path algorithms, we need to add the Bellman-Ford Algorithm.
Goal:
- Find the shortest path from a single source vertex to all other vertices.
- Correctly detect and report a negative cycle if one exists in the graph.
C++ solution
The repository currently covers shortest paths using Dijkstra's Algorithm, which fails on graphs containing negative edge weights. To complete the set of fundamental shortest-path algorithms, we need to add the Bellman-Ford Algorithm.
Goal:
C++ solution