Design and Implementation of Mobile Map Application for Finding Shortest Direction between Two Pair Locations Using Shortest Path Algorithm: A Case Study

The shortest path problem is an approach towards finding the shortest and quickest path or route from a starting point to a final destination, four major algorithms are peculiar to solving the shortest path problem. The algorithms include Dijkstra's Algorithm, Floyd-Warshall Algorithm, Bellman-Ford Algorithm and Alternative Path Algorithm. This research work is focused on the design of mobile map application for finding the shortest route from one location to another within Yaba College of Technology and its environ. The design was focused on Dijkstra's algorithm that source node as a first permanent node, and assign it 0 cost and check all neighbor nodes from the previous permanent node and calculate the cumulative cost of each neighbor nodes and make them temporary, then chooses the node with the smallest cumulative cost, and make it as a permanent node. The different nodes that lead to a particular destination were identified, the distance and time from a source to a destination is calculated using the Google map. The application then recommends the shortest and quickest route to the destination.