Optimisation circuits for theBellman-Ford computation algorithm
K.P. Lam, Chunya Tong · Electronics Letters · 1994
The Bellman-Ford algorithm is well known for providing a dynamic programming solution for the shortest path problem. The authors describe some novel optimisation circuits which incorporate the Bellman-Ford algorithm for solving closed semi-ring problems, with particular reference to the minimum spanning tree problem.