Implementasi Algoritma Bellman Ford Pada Aplikasi Pencarian Pengobatan Patah Tulang Kem Kem Terdekat di Kota Medan Berbasis Android
DOI:
https://doi.org/10.30865/jurikom.v6i1.1295Abstract
Searching for the shortest distance is a problem for people who are experiencing fractures or dislocations, because in an emergency like this there will be a big panic that often victims will experience fatal things due to delays in handling, so often the victim's family looks for the shortest path to achieving the first treatment, such as the treatment of kem fractures is one of the first examples of treatment in the treatment of fractures, the efficiency of time and cost is needed in an emergency like this, so as to minimize the fatal things that will happen to victims of fractures. One of the most effective ways in an emergency like this is to search for the fastest alternative route to get to the treatment of Kem fractures. The shortest distance search application made, based on the Bellman Ford method. The bellman ford method is an algorithm that calculates the shortest path from a single point source to find another node. The results of this study are to be able to find the closest point of treatment for Kem fracture to minimize fatalities that occur to the victim, so that the victim can be treated immediately and get treatment.
References
FI. Sigit Suyantoro, Tuntunan Praktis Membangun Sistem Informasi Akuntansi Dengan Visual Basic dan Microsoft SQL Server, Rendrasta, Ed. Yogyakarta, indonesia: C.V ANDI OFFSET, 2007.
RINALDI MUNIR, MATEMATIKA DISKRIT, revisi kelima ed., RINALDI MUNIR, Ed. Bandung, indonesia: INFORMATIKA Bandung, 2012.
Pankhari Agarwal, "New Approach of Bellman Ford Algorithm on GPU using Compute Unified Design Architecture (CUDA)," International Journal of Computer Applications (0975 – 8887, vol. 110, no. 13, p. 16, januari 2015.
Bhavana Mhatre 2, Amita Mehta 3. Sarala Khangare *1, "International Journal of Physiotherapy and Research," ASSOCIATION OF BONE MINERAL DENSITY AND BODY MASS, vol. 5, no. 2, p. 34, maret 2017.
Antonius Aditya Hartanto, Mengenal Aspek Teknis dan Bisnis Location Based Service, pertama ed., Antonius Aditya Hartanto, Ed. Jakarta, indonesia: Elex Media Komputindo, 2003.
Ali Zaki, Keliling Dunia Dengan Google Earth dan Google Maps, pertama ed., Maria Agustina S, Ed. Yogyakarta, Indonesia: C.V ANDI OFFSET, 2010.
Eka Iswandy, "PERANCANGAN SISTEM INFORMASI TENTANG PENCATATAN HASIL TES," Jurnal TEKNOIF, vol. 2, no. 2, p. 6, Oktober 2014.
Sholiq, Pemodelan Sistem Informasi Berorientasi Objek dengan UML, pertama ed., Sholiq, Ed. Yogyakarta, indonesia: Graha Ilmu, 2006.
NAZRUDDIN SAFAAT H, ANDROID PEMROGRAMAN APLIKASI MOBILE SMARTPHONE DAN TABLET PC BERBASIS ANDROID, revisi kedua ed., NAZRUDDIN SAFAAT H, Ed. Bandung, indonesia: Informatika Bandung, 2015.
Ir. Yuniar Supardi, Pemrograman Database JAVA dan MySQL, pertama ed., Ir. Yuniar Supardi, Ed. Jakarta, Indonesia: PT Gramedia Jakarta, 2007.
AgustianAji P SholehHadi Pramono M.Aziz Muslim, "Parallel Implementations for Solving Shortest Path Problem using Bellman-Ford," International Journal of Computer Applications (0975 – 8887), vol. Volume 95, no. Gaurav Hajela, p. 12, juni 2014.
Vaibhavi Patel, "A Survey Paper of Bellman-Ford Algorithm," International Journal of P2P Network Trends and Technology (IJPTT) , vol. Volume 5 , no. Assistant Professor, KalolInstitute of Technology & research Center, Gujarat, India, p. 23, February 2014.
Sarthak Budhiraja Rochan Mehrotra, "A Comparative Study between Bellman-Ford Algorithm and Dijkstras- Algorithms," Information Technology, vol. 1, no. 5, p. 22, mei 2014.
Mr. Abhishek Tyagi Ms. Kalpana, "Bellman Ford Shortest Path Algorithm using Global Positioning System," International Research Journal of Engineering and Technology (IRJET), vol. Volume: 04 , no. 04, p. 12, april 2017.
