Shortest Path Finding Using Dijkstra’s Algorithm

PIKSEL (Penelitian Ilmu Komputer Sistem Embedded dan Logic)

View Publication Info
 
 
Field Value
 
Title Shortest Path Finding Using Dijkstra’s Algorithm
 
Creator Nurhasanah, Fitri Yani
Gata, Windu
Riana, Dwiza
Jamil, Muh.
Saputra, Surya Fajar
 
Description 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.
 
Publisher LPPM Universitas Islam 45 Bekasi
 
Date 2021-03-24
 
Type info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
 
Format application/pdf
 
Identifier http://jurnal.unismabekasi.ac.id/index.php/piksel/article/view/2365
10.33558/piksel.v9i1.2365
 
Source PIKSEL : Penelitian Ilmu Komputer Sistem Embedded and Logic; Vol 9 No 1 (2021): Maret 2021; 89 - 102
2620-3553
2303-3304
10.33558/piksel.v9i1
 
Language eng
 
Relation http://jurnal.unismabekasi.ac.id/index.php/piksel/article/view/2365/1856
 
Rights Copyright (c) 2021 PIKSEL : Penelitian Ilmu Komputer Sistem Embedded and Logic
 

Contact Us

The PKP Index is an initiative of the Public Knowledge Project.

For PKP Publishing Services please use the PKP|PS contact form.

For support with PKP software we encourage users to consult our wiki for documentation and search our support forums.

For any other correspondence feel free to contact us using the PKP contact form.

Find Us

Twitter

Copyright © 2015-2018 Simon Fraser University Library