Skip to content
UPEEC

Bellman-Ford Algorithm

Shortest paths with negative edge weights — relax all edges $V-1$ times, $O(VE)$.

Advanced
Comments 0

A further relaxation that still improves means a negative cycle exists.

Spotted a mistake or want to add detail? Suggest an improvement — Content Contributors' edits are reviewed by editors before they go live.

Discussion (0)

Sign in or join free to ask questions and discuss this topic.