@article{Wayahdi_Ginting_Syahputra_2021, title={Greedy, A-Star, and Dijkstra’s Algorithms in Finding Shortest Path}, volume={2}, url={http://ijadis.org/index.php/IJADIS/article/view/greedy-a-star-and-dijkstras-algorithms-in-finding-shortest-path}, DOI={10.25008/ijadis.v2i1.1206}, abstractNote={<p>The problem of finding the shortest path from a path or graph has been quite widely discussed. There are also many algorithms that are the solution to this problem. The purpose of this study is to analyze the Greedy, A-Star, and Dijkstra algorithms in the process of finding the shortest path. The author wants to compare the effectiveness of the three algorithms in the process of finding the shortest path in a path or graph. From the results of the research conducted, the author can conclude that the Greedy, A-Star, and Dijkstra algorithms can be a solution in determining the shortest path in a path or graph with different results. The Greedy algorithm is fast in finding solutions but tends not to find the optimal solution. While the A-Star algorithm tends to be better than the Greedy algorithm, but the path or graph must have complex data. Meanwhile, Dijkstra’s algorithm in this case is better than the other two algorithms because it always gets optimal results.</p>}, number={1}, journal={International Journal of Advances in Data and Information Systems}, author={Wayahdi, Muhammad Rhifky and Ginting, Subhan Hafiz Nanda and Syahputra, Dinur}, year={2021}, month={Feb.}, pages={45-52} }