Study of the Structure of Graphs in the Optimal Path Problem: Application of Richards BELLMAN Algorithms

Data structures play an important role in problem modeling. Graphs model so many other in different domains, one always has to maximize or minimize the time or either the cost in a routing or scheduling problem. Transport networks and scheduling problems are two areas where optimization plays a key role. In this article, we are talking about how to adapt certain types of data by the graph structure. And we study the Shortest Path (SPC) and Longest Path (LPL) problem by applying BELLMAN's algorithms and see how these can be applied in scheduling when it comes to projects. An implementation of these algorithms, as well as an application on scheduling with the Metra Potential Method, in acronym MPM, enrich this article.