Komparasi Kinerja Algoritma BFS, Dijkstra, Greedy BFS, dan A* dalam Melakukan Pathfinding
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, th...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Universitas Islam Negeri Sunan Kalijaga Yogyakarta
2020-11-01
|
| Series: | JISKA (Jurnal Informatika Sunan Kalijaga) |
| Online Access: | http://ejournal.uin-suka.ac.id/saintek/JISKA/article/view/1954 |