RANCANG BANGUN APLIKASI PENCARIAN JALUR TERPENDEK MENGGUNAKAN ALGORITMA FLOYD WARSHALL (STUDI KASUS KOTA SINGKAWANG)
Keywords:
singkawang, tourism, shortest route, floydwarshall algorithm.Abstract
There are many tourist place located around Singkawang and make the tourist hard to choose the best route to go to the place that they want. That problem is the background of the writer to make an application that can show the most efficient route to the tourism place with maps view. The algorithm that writer use in this application is floyd warshall algorithm. This algorithm search the shortest route from the position of user to the tourism place that he want to go. The input of this application is the place chosen by user and the output is the shortest route to that place. The data of tourism place are came from Dinas Kebudayaan, Pariwisata, Pemuda dan Olahraga and the data of the distant route are came from Dinas Pekerjaan Umum Singkawang. Based on the research, the writer conclude that the application succeed in applying floyd warshall algorithm to search the shortest route to go to tourism place in Singkawang. In this application, there also a features for showing the location of all tourism place in Singkawang.
References
Andriansyah, Sofyan. 2010. Sistem
Informasi Tourism Guide Kota Jakarta
Dengan Menggunakan Algoritma
Djikstra. Malang: Universitas Islam
Negeri.
Dewi, L. J. E. 2010. Pencarian Rute
Terpendek Tempat Wisata Di Bali
Dengan Menggunakan Algoritma
Dijkstra. Seminar Nasional Aplikasi
Teknologi Informasi 2010 (SNATI 2010).
Yogyakarta, tanggal 19 Juni 2010.
Universitas Pendidikan Ganesha.
Murai, Shunji. 2007. Sistem Informasi
Geografis (Bab I GIS Worldbook Vol I)
Pengantar GIS. University of Tokyo.
Riyanti, Eka. 2004. Penerapan
Algoritma Branch and Bound Untuk
Penentuan Rute Objek Wisata. Bandung:
Universitas Komputer Indonesia.
Siang, Jong Jek. 2006. Matematika
Diskrit dan Aplikasinya pada Ilmu
Komputer. Yogyakarta: Andi.
Suwantoro, Gamal.1997. Dasar-dasar
Pariwisata. Yogyakarta: Andi.
Downloads
Published
Issue
Section
License
The author owns the copyright in his paper and agrees to publish his paper to JUSTIN by giving the rights to the first publication of his paper which is simultaneously licensed under the Creative Commons Attribution License, namely the Similar International 4.0 license (CC BY-NC-SA 4.0).
This is a human-readable summary of (and not a substitute for) the license. Disclaimer.
You are free to:Share "” copy and redistribute the material in any medium or format
Adapt "” remix, transform, and build upon the material
The licensor cannot revoke these freedoms as long as you follow the license terms.
Under the following terms:
Attribution "” You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
NonCommercial "” You may not use the material for commercial purposes.
ShareAlike "” If you remix, transform, or build upon the material, you must distribute your contributions under the same license as the original.
No additional restrictions "” You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.
Notices:
You do not have to comply with the license for elements of the material in the public domain or where your use is permitted by an applicable exception or limitation.
No warranties are given. The license may not give you all of the permissions necessary for your intended use. For example, other rights such as publicity, privacy, or moral rights may limit how you use the material.
