20-09-2017, 10:28 AM
The Bellman-Ford algorithm also known as Ford-Fulkerson algorithm is based on the principle that it is intuitively easy to understand. Each node A knows the shortest route to node Z, then node A can determine its shortest route to Z by calculating the minimum cost.
Each node connected to another node at a cost, now when the packet flows through a path that results in some cost to the network. To minimize the cost of network communication the Bellman-Ford algorithm is implemented and the packet flow to the path that costs the least in communication.
It can be understood in the following video: