Illustrate the Bellman-Ford algorithm
The Bellman-Ford algorithm uses only on information from its neighbours and knowledge of its link costs, to update it costs and paths. Dijkstra's algorithm needs that every node must have complete topological information about the network; that is, every node must know the link costs of all links in the network.