Pencarian Rute Terpendek di Kota Semarang, Kecamatan Semarang Tengah, Dengan SIG dan Metode Dijkstra

Goeuawan, David and Dwi Hartomo, Kristoko (2005) Pencarian Rute Terpendek di Kota Semarang, Kecamatan Semarang Tengah, Dengan SIG dan Metode Dijkstra. JURNAL TEKNOLOGI INFORMASI, 02 (01). ISSN 1693-8348

Full text not available from this repository.
Official URL: http://library.binus.ac.id/Collections/journal_det...

Abstract

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.

Item Type: Article
Additional Information: 6_Volume 02 / Nomor 01 / February 2005_Pencarian Rute Terpendek di Kota Semarang, Kecamatan Semarang Tengah, Dengan SIG dan Metode Dijkstra
Subjects: Information Technology
Divisions: ?? journal_45_6_Volume-02-Nomor-01-February-2005 ??
Depositing User: Mr. Super Admin
Date Deposited: 30 May 2013 17:33
Last Modified: 03 Jun 2013 04:17
URI: http://eprints2.binus.ac.id/id/eprint/26710

Actions (login required)

View Item View Item