This Author published in this journals
All Journal Jurnal Mantik
Claim Missing Document
Check
Articles

Found 1 Documents
Search

Djikstra algorithm for finding the shortest route to company addresses in industrial areas Jamaludin Jamaludin; Didik Setiyadi; Endang Retnoningsih
Jurnal Mantik Vol. 7 No. 3 (2023): November: Manajemen, Teknologi Informatika dan Komunikasi (Mantik)
Publisher : Institute of Computer Science (IOCS)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.35335/mantik.v7i3.4432

Abstract

Electronic maps are an application that implements manual maps into a web-based system. Useful for optimizing data from manual maps into useful information. By using a geographic information system (GIS), users can search for the location of the desired company. In this research, the Dijkstra algorithm method was implemented to find the shortest path in GIS. GIS technology uses the Dijkstra algorithm to provide data information by visually displaying road location data, place locations and the shortest path from the origin to the destination location on a map. The shortest route search geographic information system displays spatial data visualization of industrial area maps that are integrated with GoogleMaps