COMPARATIVE ANALYSIS AND IMPLEMENTATION OF DIJKSTRA’S AND FLOYD’S ALGORITHMS FOR OPTIMAL TRANSPORTATION NETWORK OF MOTORCYCLE TOWN SERVICE

Abstract

The paper aimed at presenting the results of a comparative analysis of the shortest path using Dijkstra’s and floyd’s Algorithms to find minimum links for commercial motorcycles that ply the routes in particular town. For the two algorithms, minimum paths were identified to ease good movement and reduce cost of fueling for the commercial motorcyclists. The results shows that floyd’s is more effective in solving shortest path between all pairs while dijkstra is more effective between a given pairs. It was concluded that both algorithms are effective/efficient (because they provide the same solution) depending on what the problem solver wants