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 work with the formula
with the pivot row and pivot column being row k.
Then, evaluation of the shortest route between Government House and Amuzukwu Primary School all in Umuahia and Abuja by the above method revealed it to be 720 m by taking the route SACDFG.
It was remarked that the longest route which is the route form government House to Ibiam road, to Aba road, to Warri road, to Club road, to Uwalaka road, and finally to Amuzukwu Road which now terminates at our Destination, Amuzukwu Primary School with Road distance of 2590 m does not posses other advantages while it should be made use of. The shortest routes were necessarily recommended to road users as the best route to use because its route SACDJFGT is the shortest route with the distance of 1790 m.
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.