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