This image was acquired from
wikimedia. It was marked as Public Domain or CC0 and is free to use. To verify, go to the source and check the information there.
Keywords from Image Description:
BellmanFord worstcase example.svg en worstcase example graph for BellmanFord algorithm simple path with vertices Assuming that the source is and the edges are processed from right to left it will take or iterations for the minimum distances labelled below each node to fully converge Conversely if the edges are processed from left