Shortest Path Finding System by using Transitive Closure and Dijkstra’s Algorithms

Abstract

Nowadays, optimization/minimization is a key factor in almost all topics of operation research, management science and economic. Road networks can be minimized within different constraints like time, distance, cost and traffic running on the road. This study is based on distance to calculate shortest path. This paper is intended to present shortest path finding system on Mandalay road map. In this system, Transitive Closure and Dijkstra’s algorithms are used to find the shortest path. Transitive Closure algorithm is used to get all pairs of paths and the result is used to check whether there is a path between user chosen source and destination. If the pair of path exists, then Dijkstra’s algorithm calculates shortest path of user desired source and destination. And then the result of shortest path is display to user. This system presents how it can be applied Transitive Closure and Dijkstra’s Algorithms on Mandalay road map. In this system, the locations of Mandalay as vertices and associated distance between each location as weight of edges of a directed graph.