Shortest Path Finding of Secondary Schools in Langkat District Based on Dijkstra's Algorithm

Husnul Khair, Herman Mawengkang, Syahril Efendi, Andria Rezki

Abstract


In the area of LangkatDistrict, there are so many secondary schools, that people have problems in finding the location and path to these secondaryschools. The web-based Geographic Information System (GIS) can make it easier for users to access information on the location of secondary schoolsin finding the shortest pathby using the WebGIS platform –GoogleMapsbased on DjikstraAlgorithm. Geographic Information System built with programming languages that use PHP and for MySQL databases, but it cannot be used in a graph whose path is negative. The results of the Djikstraalgorithm calculation, the initial path chosen is V1, PrumnasTaman Kw Damairoad, heading to V3, PerintisKemerdekaan road, with a distance of 5 km, then passing the Kuala Begumit road with a distance of 2 km, then passing Tengku Amir Hamzah road to the Proklamasi road, with a distance of 9 km, the shortest path is 16 km. So it can be concluded that the shortest path to get to SMA N 1 Stabat is 16 km by passing through 4 roads.


Keywords


Secondary school’s location and shortest path, Geographic Information System, Djikstra’s Algorithm

Full Text:

PDF

References


Eddy Prahasta, 2014. Sistem informasi Geografis Konsep-Konsep Dasar (Perspektif Geoesi & Geomatika), Edisi Revisi, Penerbit Informatika, Bandung

http://repository.usu.ac.id/bitstream/123456789/11850/1/09E00045.pdf pukul 12.40 tanggal 14 Juli 2015

http://www.gunadarma.ac.id/ pukul 12.20 tanggal 13 Juli 2015


Refbacks

  • There are currently no refbacks.


Copyright (c) 2018 Husnul Khair, Herman Mawengkang, Syahril Efendi, Andria Rezki

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.