Article Per Year (5 Year)
p-Index From 2019 - 2024
0.23
P-Index
This Author published in this journals
All Journal Journal of Computer Science, Information Technology and Telecommunication Engineering (JCoSITTE)
M.Ilham Mufit
Universitas Muhammadiyah Sumatera Utara
Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Electrical & Electronics Engineering

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

 1 
Implementation of Dijkstra's Algorithm to Determine the Shortest Route in a City Indah Purnama Sari; M. Fahri Fahroza; M.Ilham Mufit; Isnaini Faiz Qathrunad
Journal of Computer Science, Information Technology and Telecommunication Engineering Vol 2, No 1 (2021)
Publisher : Universitas Muhammadiyah Sumatera Utara, Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30596/jcositte.v2i1.6503

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.
Co-Authors Indah Purnama Sari Isnaini Faiz Qathrunad M. Fahri Fahroza