Design of a Modified Dijkstra’s Algorithm for finding alternate routes for shortest-path problems with huge costs

The classical Dijkstra’s algorithm has been widely used in shortest path problems. It is indeed one of the most referenced shortest path algorithms. However, it is observed that in certain circumstances finding shortest paths between given nodes may be achieved at a huge cost especially where time and efforts are of significant consideration. Such cases are the basic consideration in this study. Solution to such situations requires a modified Dijkstra’s algorithm, which is proposed in this study. The methodology entailed creation of a text file containing the nodes, edges and probabilities of moving between edges. The probabilities were generated using a random number generation scheme. The contents of the text file were read character by character and the proposed Dijkstra’s algorithm was invoked. The algorithm was tested using a 40-node graph; and the possible routes were generated. The findings revealed the shortest route and implies therefore that the proposed modified Dijkstra’s algorithm can be used as alternative to the classical Dijkstra’s strategy whenever the need arises.The next phase of this ongoing research will compute the complexity of the modified algorithm using both the analytical and numerical computation, in order to establish how it compares with the classical Dijkstra’s algorithm.