Rancang Bangun Aplikasi untuk Menentukan Jalur Terpendek Menggunakan Algoritma Floyd di Lokasi Wisata Purbalingga
DOI:
https://doi.org/10.30595/juita.v2i2.618Keywords:
Purbalingga tourism, Floyd Algorithm, Shortest PathAbstract
Purbalingga tourism are scattered in various locations complicate for local or foreign tourist in determining the path to go to tourist sites. By determining the starting point of shortest path from the town square of Purbalingga, the shortest path can be searched using Floyd algorithm. The workings of this algorithm are to find the possible paths exist by aggregating and comparing the points with positive weights on the path which has constructed and determined. The result of this research was obtained the shortest path to go to the various tourist sites in PurbalinggaReferences
Andi., 2004, Dasar Pemrograman Web Dinamis Dengan JSP, Andi Offset, Yogyakarta.
Cormen, T. H., Leiserson, C. E., Rivest, R. L., 2001, Introduction to Algorithms, Second Edition, MIT Press., Cambridge.
Ladjamuddin, B., 2004, Konsep Sistem Basis Data Dan
Implementasinya, Graha Ilmu, Yogyakarta.
Nugroho, A. 2008,Algoritma Dan Struktur Data Dalam Bahasa Java,Andi, Yogyakarta.
Pressman, R.S., 2001, Software Engginering, Mc Graw-Hill Higher Education., New York.
Riyanto., 2010, Sistem Informasi Geografi Berbasis Mobile, http://id.wikipedia.org/wiki/Algoritma_Floyd- Warshall, diakses tanggal 11 Januari 2012.
Downloads
How to Cite
Ardiansyah, I., & Hakim, D. K. (2016). Rancang Bangun Aplikasi untuk Menentukan Jalur Terpendek Menggunakan Algoritma Floyd di Lokasi Wisata Purbalingga. JUITA: Jurnal Informatika, 2(2). https://doi.org/10.30595/juita.v2i2.618
Issue
Section
Articles
License
JUITA: Jurnal Informatika is licensed under a Creative Commons Attribution 4.0 International License.
