PIKSEL : Penelitian Ilmu Komputer Sistem Embedded and Logic
Vol 9 No 1 (2021): Maret 2021

Shortest Path Finding Using Dijkstra’s Algorithm

Nurhasanah, Fitri Yani (Unknown)
Gata, Windu (Unknown)
Riana, Dwiza (Unknown)
Jamil, Muh. (Unknown)
Saputra, Surya Fajar (Unknown)

Article Info

Publish Date
24 Mar 2021

Abstract

In the professional work, discipline is a very important to see work ethic of an employee. Discipline has also the most important element of good behavior, both as individual and social. A problem is when people on the road in finding the shortest path in order to get to the destination on time. Finding shortest path improves workers discipline and add value to employees. With the Dijkstra’s Algorithm, we can find the shortest route. The value on the edge of a graph can be expressed as the distance between nodes (roads). Through this proposed application, it easier for us to find the shortest route in a more effective time.

Copyrights © 2021




Citation Download
RIS
EndNote, Reference Manager, ProCite
BibTex
Latex, Jabref
Original Source
Download Original
Google Scholar
Check in Google Scholar
Journal Info
PIKSEL : Penelitian Ilmu Komputer Sistem Embedded and Logic
Website

Abbrev

piksel

Publisher

Universitas Islam 45 Bekasi

Subject

Computer Science & IT Decision Sciences, Operations Research & Management

Description

Jurnal PIKSEL diterbitkan oleh Universitas Islam 45 Bekasi untuk mewadahi hasil penelitian di bidang komputer dan informatika. Jurnal ini pertama kali diterbitkan pada tahun 2013 dengan masa terbit 2 kali dalam setahun yaitu pada bulan Januari dan September. Mulai tahun 2014, Jurnal PIKSEL mengalami ...