Compare the Path Finding Algorithms that are Applied for Route Searching in Maps

The purpose of the conducted research is to find the most optimal algorithm in terms of finding the shortest path that are applied for route searching in maps. This research will compare the pathfinding algorithm such as Dijkstra, BFS, and A * algorithms in terms of time, path, and distance found, by considering the existing real life variables such as distance, weather, average speed, obstructions, and road width that are encountered by every road users to increase accuracy. With the characteristic and following the procedure of each algorithm, we finally manage to dive thoroughly about how the algorithm works by performing calculation and analyze the advantages and drawbacks of each algorithm. The comparison will be made by a system designed using Python Programming Language. This study concludes that Dijkstra's algorithm is 13.78% faster than A * Algorithm and 32.3% faster than Breadth First Search in terms of time but the paths found are not always optimal.