Pencarian Rute Terpendek di Kota Semarang, Kecamatan Semarang Tengah, Dengan SIG dan Metode Dijkstra
| Main Authors: | Goeuawan, David, Dwi Hartomo, Kristoko |
|---|---|
| Format: | Article PeerReviewed |
| Terbitan: |
Binus University
, 2005
|
| Subjects: | |
| Online Access: |
http://eprints.binus.ac.id/26710/ http://library.binus.ac.id/Collections/journal_detail.aspx?subject=6&volnoed=Volume 02 / Nomor 01 / February 2005&title=Pencarian Rute Terpendek di Kota Semarang, Kecamatan Semarang Tengah, Dengan SIG dan Metode Dijkstra |
Daftar Isi:
- Dijkstra is a method to find the shortest distance from one place to a particular destination. It will find the shortest distance and also its route from the start to the intended location. The location where it starts and ends are only determined once. This method only produced one shortest way only and did not give any alternative ways. In this paper, it is explained about the application of Dijkstra method in Semarang Tengah supported by GIS (Geographic Information System). The GIS will give the information of the name of the start location and the destined location. With this kid of information system exists in Semarang Tengah, and then it can be used to take a decision.