Muhammad, Alfiansyah (2017) Implementasi Algoritma Dijkstra untuk menentukan rute terpendek lokasi tempat ibadah di Kota Purwokerto. Undergraduate Thesis thesis, Institut Teknologi Telkom Purwokerto.
![[img]](http://repository.ittelkom-pwt.ac.id/style/images/fileicons/text.png) |
Text
Cover.pdf - Accepted Version Download (99kB) |
|
|
Text
Abstrak.pdf - Accepted Version Download (144kB) | Preview |
|
|
Text
Abstract.pdf - Accepted Version Download (145kB) | Preview |
|
|
Text
BAB I.pdf - Accepted Version Download (147kB) | Preview |
|
|
Text
BAB II.pdf - Accepted Version Download (388kB) | Preview |
|
|
Text
BAB III.pdf - Accepted Version Download (430kB) | Preview |
|
|
Text
BAB IV.pdf - Accepted Version Restricted to Registered users only Download (894kB) | Request a copy |
|
|
Text
BAB V.pdf - Accepted Version Download (13kB) | Preview |
|
|
Text
Daftar Pustaka.pdf - Accepted Version Download (127kB) | Preview |
Abstract
The information about places of worship in North Purwokerto is still inadequate which causes difficulty for the local communities or immigrants in North Purwokerto to locate the places. The routes to go to the places of worship are too far which make people lazy to do worship. The purpose of this research is to build an Android-based application that can display the location places of worship, provide information places of worship and determine the shortest routes to go to the places of worship in North Purwokerto. The application uses Dijkstra algorithm for determining the shortest routes. The application is developed using spiral method which contains five general phases namely, communication, planning, modeling, construction and deployment. This application is using Java language and SQLite database. The result is a mapping application places of worship by implementing Dijkstra algorithm and Google Map API. The final test of the application shows that application can run on Android JellyBean platform and later version. The shortest routes which are generated from the application is compared with Google Direction. The comparison shows that Dijkstra algorithm can be applied to find the shortest routes. Keyword : Places of Worship, Dijkstra, Google Map, Android, Spiral
| Item Type: | Thesis (Undergraduate Thesis) |
|---|---|
| Subjects: | T Technology > T Technology (General) |
| Divisions: | Faculty of Industrial Engineering and Informatics > Informatics Engineering |
| Depositing User: | staff repository 1 |
| Date Deposited: | 28 Dec 2017 02:54 |
| Last Modified: | 22 Apr 2021 07:44 |
| URI: | http://repository.ittelkom-pwt.ac.id/id/eprint/48 |
Actions (login required)
 |
View Item |
