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