IMPLEMENTASI ALGORITMA DIJKSTRA UNTUK MENENTUKAN RUTE BENGKEL TERDEKAT DI KECAMATAN MLATI YOGYAKARTA

Muna, Nabilah (2019) IMPLEMENTASI ALGORITMA DIJKSTRA UNTUK MENENTUKAN RUTE BENGKEL TERDEKAT DI KECAMATAN MLATI YOGYAKARTA. Tugas Akhir thesis, University of Technology Yogyakarta.

[img]
Preview
Text
Naskah Publikasi-Nabilah Tanjach Muna-5150411109.pdf

Download (750kB) | Preview

Abstract

The development of science and information technology today is very fast; the human need for information spurred the rapid development of information and communication technology, in line with the times of the use of technology which is increasing and has a very important role in providing the information we need. Information about the nearest motorcycle repair shop route is very important when we have an emergency on the road such as a leaky tire, a dead machine, etc. Information about the nearest garage repair route is very important to help the public when in an emergency on the road. However, providers of information about the details of the nearest workshop are very minimal so it is still difficult to find the location of the closest workshop. Implementation of Dijkstra's Algorithm to Determine the Nearest Workshop Raute in the Mlati District of Yogyakarta includes information and the nearest workshop route. Therefore the Implementation of Dijkstra's Algorithm to Determine the Closest Workshop Route in the Mlati District of Yogyakarta can facilitate the public in finding information and the nearest workshop route in Yogyakarta. Keywords: Implementation, Dijkstra's Algorithm, Workshop, Mlati Yogyakarta

Item Type: Thesis (Skripsi, Tugas Akhir or Kerja Praktek) (Tugas Akhir)
Subjects: T Technology > T Technology (General)
Divisions: Fakultas Teknologi Informasi dan Elektro > S1 Informatika
Depositing User: Kaprodi S1 Informatika UTY
Date Deposited: 02 Nov 2019 01:00
Last Modified: 02 Nov 2019 01:00
URI: http://eprints.uty.ac.id/id/eprint/4131

Actions (login required)

View Item View Item