Nurdianti, Taing Sapitri (2020) Penerapan Algoritma Greedy Untuk Menentukan Rute Terpendek Antar Klinik Gigi Di Kota Medan Berbasis Mobile. Skripsi thesis, Universitas Islam Negeri Sumatera Utara.
|
Text
PDF - SKRIPSI - ILMU KOMPUTER - TAING SAPITRI NURDIANTI.pdf Download (3MB) | Preview |
Abstract
Dental and oral health is an indicator of public health. The presence of health problems in teeth and mouth leads to a decrease in individual health functions. Dental and oral health problems are caused by the habit of a person brushing teeth unregularly. Many options can be made to get to the location where the nearest dental clinic is desirable, but there are circumstances where the planned dental clinic is not open. Therefore it takes the shortest route to get to another dental clinic. Data in the form of distance, time and route to get to the desired dental clinic is taken from Google map, with a total of 10 vertices to apply to the map (maps). For the results of the map, an algorithm is used, in which case the Greedy algorithm is used to solve the problem of finding the shortest route. Based on the research results from the dental clinic closest to the starting point is sought using the Greedy algorithm it generates the total distance, travel time and the point passed.
| Jenis Item: | Skripsi (Skripsi) |
|---|---|
| Subjects: | 000 Generalities > 005 Computer programming, programs, data |
| Divisions: | Fakultas Sains dan Teknologi > Ilmu Komputer > Skripsi |
| Pengguna yang mendeposit: | Ms Nurul Hidayah Siregar |
| Date Deposited: | 26 Oct 2020 05:27 |
| Last Modified: | 26 Oct 2020 05:27 |
| URI: | http://repository.uinsu.ac.id/id/eprint/9724 |
Actions (login required)
 |
View Item |
["Plugin/Screen/EPrint/Box/Plumx:title" not defined]
["Plugin/Screen/EPrint/Box/Plumx:title" not defined]