Implement Bellman Ford’s Algorithm
Open
enhancement
Hacktoberfest
help wanted
- Dominant language
- C++
- Stars
- 2
- Forks
- 1
- PR merge metrics
- No merged PRs in 30d
Description
> Bellman Ford’s algorithm is a shortest path finding algorithm for graphs that can have negative weights. Bellman ford’s algorithm is also great for detecting negative weight cycles as the algorithm converges to an optimal solution in O(V*E) steps. If the resultant is not optimal, then graph contains a negative weight cycle.
Contributor guide
No contributing guide indexed for this repository
Assessment
This issue has not been assessed yet.