Bellman-Ford algorithm

Bellman-Ford algorithm find shortest-path in a [[graph]], from one vertex to the other ones. It's like Dijkstra algorithm, but can handle negative weighted edges. It's also slower.

Complexity

Time complexity

• Worst-case: $O(|V||E|)$
• Best-case: $\mathrm{\Omega }(|E|)$

Resources

• Bellman-Ford in 5 minutes – Youtube