Bellman-Ford Algorithm - an overview | ScienceDirect Topics
These fixed-point equations can be solved by the recursion χn+1=F(χn). It can be shown that this recursion will converge to the vector of minimum delays for any nonnegative initial vector x0. The resulting al