Main Article Content
In this research, dynamic programming seeks to address the problem of determining the shortest path between a source and a sink by the method of a fixed-point iteration well defined in the metric space (X,d), d the distance on X=U the connected series of edges that suitably works with the formula
With the pivot row and pivot column being row k.
Then, evaluation of the shortest route between Umuahia and Abuja by the above method revealed it to be 702 km by going from Umuahia through Enugu through Ankpa through Lokoja and then to Abuja (i.e., TED GS. by the Backward dynamic method)
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
This is an Open Access article distributed under the terms of the Attribution-Noncommercial 4.0 International License [CC BY-NC 4.0], which requires that reusers give credit to the creator. It allows reusers to distribute, remix, adapt, and build upon the material in any medium or format, for noncommercial purposes only.