APLIKASI PENCARIAN JALUR TAMAN WIFI GRATIS KOTA SEMARANG DENGAN MENGGUNAKAN ALGORITMA DIJKSTRA

  • Herny Februariyanti
  • Cupu Skolastika
Keywords: Djikstra algorithm, free garden search application, shortest route

Abstract

Abstract -Semarang City is one of the cities that is building its city program to advance in the movement of 100 cities or districts to smartcity, one of which is by providing free wifi services in Semarang City parks. With the public services provided by the Semarang city government, it will be useful to support internet needs among modern society. But many people do not yet know the location of places from free park wifi and the nearest route to the location of the free wifi park. The purpose of this study was to design and realize the search for free Semarang garden paths using the dijkstra algorithm.

The design of the free Semarang wifi park path search application using the dijkstra algorithm is made using tools such as PHP, Xampp, Bootstrap, Android Studio.

The results of the free Semarang wifi garden path search application using the dijkstra algorithm that can be downloaded in the playstore. With this application it helps provide information about the location of free wifi parks in the city of Semarang and the completion of the shortest route using the dijkstra algorithm is considered more efficient because this algorithm searches for the lowest weight of the route traveled.

References

DAFTAR PUSTAKA

Kadir, A. (2003)Pengenalan Sistem Informasi, Andi, Yogyakarta.

Ningati, R. (2014) AplikasiPencarianRuteTerpendek Daerah Wisata Kota Kediri MenggunakanAlgoritma Dijkstra,Skripsi, Fakultas Teknik, Universitas Nusantara PGRI, Kediri.

Pugas, D.O.(2011). PencarianRuteTerpendekMenggunakanAlgoritma Dijkstra dan Astar (A*) pada SIG Berbasis Web untukPemetaanPariwisata Kota Sawahlunto. Skripsi, Fakultas Teknik Universitas Diponegoro, Semarang.

Sholichin, R. dan Yasindan, M. (2012) ImplementasiAlgoritma Dijkstra DalamPencarianLintasanTerpendekLokasiRumahSakit, Hotel Dan Terminal Kota Malang Berbasis Web, Skripsi, Universitas Negeri Malang, Malang.

Supriyanto. (2017)PenerapanAlgoritmaDijkstra untukmenentukanjalurterpendeklokasibengkelahass di Kabupaten Bantul, Skripsi, Program Sudi Teknik Informatika, Sekolah Tinggi Manajemen Informatika dan Komputer AKAKOM, Yogyakarta.

Yuliana, A. (2013). Implementasi Algoritma Dijkstra Pencarian Rute TerpendekTrans Yogya, Skripsi, Fakultas Sains dan Teknologi Teknik, UIN Sunan KAlijaga, Yogyakarta.
Published
2019-08-12
How to Cite
Februariyanti, H., & Skolastika, C. (2019). APLIKASI PENCARIAN JALUR TAMAN WIFI GRATIS KOTA SEMARANG DENGAN MENGGUNAKAN ALGORITMA DIJKSTRA. Information Technology and Telematics, 9(1). Retrieved from https://unisbank.ac.id/ojs/index.php/fti3/article/view/6770
Section
Articles