Mini Project on Bellman-Ford algorithm using OpenGL

Rajeev
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 flow to the path which costs less in the communication.  Working Principle First  we draw the nodes and connecting lines by passing co-ordinate values to a GL_LINES .It will draw the network and connections of the network. The shortest path is calculated by using Bellman-Ford algorithm using the following formula- 1.Initialization                                              Di=∞; for all i≠ d                                 (3.1)                                              Dd=0              …

2 comments

  1. shalini
    please send me the code for this project
  2. sanaya
    Sir plz send me the error free source code of dis algorithm...