Article Per Year (5 Year)
p-Index From 2020 - 2025
0.23
P-Index
This Author published in this journals
All Journal JISKa (Jurnal Informatika Sunan Kalijaga)
Nurma Romihim Fadilah
Unknown Affiliation
Computer Science & IT Electrical & Electronics Engineering Library & Information Science

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

 1 
Komparasi Kinerja Algoritma BFS, Dijkstra, Greedy BFS, dan A* dalam Melakukan Pathfinding Nadila Sugianti; Ainatul Mardhiyah; Nurma Romihim Fadilah
JISKA (Jurnal Informatika Sunan Kalijaga) Vol. 5 No. 3 (2020): November 2020
Publisher : UIN Sunan Kalijaga Yogyakarta

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (20136.583 KB) | DOI: 10.14421/jiska.2020.53-07

Abstract

Pathfinding is a computational process in finding the best route between two points or nodes to find the shortest path. This method has many algorithms that can be applied in various fields. In carrying out the pathfinding, speed and distance are considered as important. Through the test diagram, this paper illustrates the execution steps related to the pathfinding algorithm which includes BFS, Dijkstra, Greedy BFS, and A * for comparison. From several studies, the authors identified that execution time and mileage can be used optimally in the comparison process. Input variables as well as media used are 2-dimensional grids and heuristic function calculations. The analogy is carried out on a unity platform with the C# programming language, producing A * as a more flexible pathfinding algorithm to be implemented in various domains.
Co-Authors Ainatul Mardhiyah Nadila Sugianti