Bellman-Ford Algorithm
:
Solves the shortest path problem in graphs with negative weights.
Time complexity: \(O(V \times E)\)
Can detect
negative weight cycles
.