Modification of Toroslu’s Improved Floyd-Warshall Algorithm Applied in Road Networks

Abstract

Travelers have been struggling to save time and resources due to worsening traffic. This problem with traffic has also been affecting the environment and economy. Shortest path algorithms aid in reducing the travel time of motorists. Toroslu's algorithm is a shortest path algorithm that returns the least cost between all pairs of vertices in a graph. In the interest of road networks and unpredictable traffic conditions, the algorithm used should cater for dynamic changes and have the ability to return the exact path. The researchers utilized the concept of predecessors and implemented Krishna, Moorthy, Gayathri's dynamic graph algorithm to address the limitation of Toroslu's algorithm. Results showed that the modified algorithm returns the correct costs and paths for every change made in the graph.