Bellman-Ford Algorithm
Shortes-path algorithm for wheighted graphs.
The algorithm was developed by Richard Bellman and Lester R. Ford (Jr.) independently.
References
[
Bellman1958
] Bellman Algorithm
[
Ford1956
] Ford Algorithm
(C) 2004-2006 University of Luxembourg, SECAN-Lab
Original Version
VeryQuickWiki - HTML Export - Printable Version
Version: 2.7.1 (UniLux: 1.15.0 2006-01-19)
Modified: 2005-02-28 14:09:43
Exported: 2010-03-11 02:38:03
