Author(s): Abraham Jighjigh Tamber, Gabriel Apine Ateata and Paul Amon

Abstract: In the research work, the A* algorithm was modified in the steps and used to solved shortest path problem of Multiple sources-Multiple destinations network which originally cannot handle the network directly except by splitting it into either networks of single source-single destination or source-multiple destinations before superimposing them into a single network. However, the modified algorithm reduced the computational complexity rapidly by solving the problem at once without splitting it into either a networks of single source-single destination or network of source-multiple destinations like in the case of the existing algorithms.

DOI: 10.33545/2707661X.2021.v2.i1a.23

Pages: 16-18 | Views: 565 | Downloads: 215

Download Full Article: Click Here