Journal of Computer Science, Information Technology and Telecommunication Engineering (JCoSITTE)
Vol 2, No 1 (2021)

Implementation of Dijkstra's Algorithm to Determine the Shortest Route in a City

Indah Purnama Sari (Universitas Muhammadiyah Sumatera Utara, Indonesia)
M. Fahri Fahroza (Universitas Muhammadiyah Sumatera Utara)
M.Ilham Mufit (Universitas Muhammadiyah Sumatera Utara)
Isnaini Faiz Qathrunad (Universitas Muhammadiyah Sumatera Utara)



Article Info

Publish Date
09 Mar 2021

Abstract

This study discusses the search for the shortest route from city A to city G using the Dijkstra algorithm based on distance traveled. Dijkstra's algorithm is one of the algorithms used to solve the shortest path and does not have a negative cost. The greedy strategy used in this algorithm is that each node in the graph will find the minimum value. This algorithm will look for a path with the minimum cost from one point to another. The purpose of this research is to understand the implementation of Dijkstra's algorithm on a graph to get the shortest route that is most optimal. The experimental results from city A to city G using Dijkstra's algorithm obtained the shortest route, which is 6 km with the route of city A - city C - city D - city E - city G.

Copyrights © 2021






Journal Info

Abbrev

jcositte

Publisher

Subject

Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Electrical & Electronics Engineering

Description

ournal of Computer Science, Information Technology and Telecommunication Engineering (JCoSITTE) is being published in the months of March and September. It is academic, online, open access (abstract), peer reviewed international journal. The aim of the journal is to: Disseminate original, ...