Greedy, A-Star, and Dijkstra’s Algorithms in Finding Shortest Path

International Journal of Advances in Data and Information Systems

View Publication Info
 
 
Field Value
 
Title Greedy, A-Star, and Dijkstra’s Algorithms in Finding Shortest Path
 
Creator Wayahdi, Muhammad Rhifky
Ginting, Subhan Hafiz Nanda
Syahputra, Dinur
 
Subject Greedy algorithm
A-Star algorithm
Dijkstra’s algorithm
Path finding
Shortest path
 
Description 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.
 
Publisher Indonesian Scientific Journal
 
Date 2021-02-01
 
Type info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
 
Format application/pdf
 
Identifier http://ijadis.org/index.php/IJADIS/article/view/greedy-a-star-and-dijkstras-algorithms-in-finding-shortest-path
10.25008/ijadis.v2i1.1206
 
Source International Journal of Advances in Data and Information Systems; Vol. 2 No. 1 (2021): April 2021 - International Journal of Advances in Data and Information Systems; 45-52
2721-3056
 
Language eng
 
Relation http://ijadis.org/index.php/IJADIS/article/view/greedy-a-star-and-dijkstras-algorithms-in-finding-shortest-path/22
 
Rights Copyright (c) 2021 Muhammad Rhifky Wayahdi, Subhan Hafiz Nanda Ginting, Dinur Syahputra
https://creativecommons.org/licenses/by-sa/4.0
 

Contact Us

The PKP Index is an initiative of the Public Knowledge Project.

For PKP Publishing Services please use the PKP|PS contact form.

For support with PKP software we encourage users to consult our wiki for documentation and search our support forums.

For any other correspondence feel free to contact us using the PKP contact form.

Find Us

Twitter

Copyright © 2015-2018 Simon Fraser University Library