 |
 |
 |
 |
| |
|
|
|
|
SECAN-Lab Home News Projects SECAN-LAB Mesh Sequencer U-2010 NARTUS EFIPSANS IRMA SECRICOM The Group Members Publications Theses Teaching Presentations Topics Mobile Computing Ad-Hoc Networks Ad-Hoc Protocols Mesh Computing Trust Related Stuff L-101 Laboratory Systems AS28 Systems 802.11 Network Simulator Internships Conferences Publications Standards Projects Links Partners OSTN Miscellaneous Contact About Job Opportunities Search |
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 "Bellman-Ford Algorithm" is mentioned on: Ad-Hoc Protocols (Classification) | Ad-Hoc Protocols (History) | Distributed Bellman-Ford |