Author:
Anwar Yusuf,Thamrin Husni
Reference19 articles.
1. Handy Permana S.D., Yogha Bintoro K.B., Arifitama B., Syahputra A. Comparative Analysis of Pathfinding Algorithms A *, Dijkstra, and BFS on Maze Runner Game. IJISTECH (International J Inf Syst Technol. 2018 May 25;1(2):1.
2. Noori A., Moradi F. Simulation and Comparison of Efficiency in Pathfinding algorithms in Games. Ciência e Nat. 2015 Dec 19;37:230.
3. Ramadhan A., Jonemaro E.M.A., Akbar M.A. Penerapan Theta* Pathfinding untuk Navigasi Non-Player Character pada Gim Maze | Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer. J Pengemb Teknol Inf dan Ilmu Komput [Internet]. 2019 [cited 2022 Feb 2];3(no. 9):8599–607. Available from: https://j-ptiik.ub.ac.id/index.php/j-ptiik/article/view/6218
4. Komparasi Kinerja Algoritma BFS, Dijkstra, Greedy BFS, dan A* dalam Melakukan Pathfinding
5. Wijaya A., Kurniawan E., Id A.A. Implementasi Algorithma Dijkstra Dalam Pencarian Rute Terpendek Fasilitas Kesehatan Tingkat I (Studi Kasus BPJS Kesehatan Kota Bengkulu). J MEDIA INFOTAMA [Internet]. 2019 Oct 17 [cited 2022 Feb 2];15(2). Available from: https://jurnal.unived.ac.id/index.php/jmi/article/view/871