Shortest path (route) determination in telecommunication network systems in Nigeria. – O. A. Ofem and E. E. Williams
An algorithm that is designed essentially to find a path of minimum length between two specified vertices of a connected weighted graph is known as shortest path algorithm. The algorithm for solving a class of these kind of problem was developed by E. W. Dijkstra in 1959. The fundamental aim of this research paper is to establish a means through which data can traverse from one point to another with the minimum distance.