|
Related articles:
Distance-vector routing protocol
Routing Information Protocol
Key terms: algorithm algoritmo code consider contains cycle distance each node each vertex edges ford graph induction infinity jr mod k most the length negative node other nodes path pp predecessor problem routing s improvement shortest path source step sub table uv v vertex vertices weight yen Search external links cited by footnotes on Wikipedia page Bellman-Ford algorithm: |
|