Abstract
Some applications, such as Google Maps, require an effective algorithm, to determine the shortest route. The two most commonly used algorithms to solve this problem are the Djikstra and A-Star algorithms. The Djikstra algorithm is famous for its accuracy in finding the shortest route by exploring all possible routes, but it has the disadvantage of long computation times on large graphs. The A-Star algorithm, on the other hand, uses heuristics to guide searches to destinations faster, reduce the number of nodes explored, and speed up computational time. The study analyzed the comparison of the two algorithms using Python in Colab. The focus of the research is the computing time and the smallest route accuracy produced. The results showed that both algorithms had the same ability to find the shortest route, but A-Star was more efficient in computing time. Recommendations are given for the use of each algorithm based on graph size and priority of computing needs. This research is expected to provide insight for application developers in choosing the algorithm that best suits their needs.