A worst-case example graph for Bellman-Ford algorithm, a simple path with 5 vertices. Assuming that the source is A and the edges are processed from right to left, it will take |V| - 1 or 4 iterations for the minimum distances (labelled below each node) to fully converge. Conversely, if the edges are processed from left to right, it will converge in a single iteration, and the diagram can be interpreted to mean how the estimates change after examining each edge.
<a href="//commons.wikimedia.org/wiki/User:Dcoetzee" title="User:Dcoetzee">User:Dcoetzee</a>
<span class="int-own-work" lang="en">Own work</span>