Mini Project on Bellman-Ford algorithm using OpenGL
― Descriptions : The Bellman-Ford algorithm also known as Ford-Fulkerson algorithm is based on the principle that is intuitively easy to understand. Each node A knows the shortest path to node Z, then node A can determine its shortest path to Z by calculating the minimum cost.Each node connected to another node with a cost, now when the packet flows through a path it result some cost to the network . To minimize the cost of network communication Bellman-Ford algorithm is implemented and the packet [...].
