Shortest Path Finding Using Dijkstra’s Algorithm

  • Fitri Yani Nurhasanah STMIK Nusa Mandiri Jakarta Depok
  • Windu Gata STMIK Nusa Mandiri Jakarta Depok
  • Dwiza Riana STMIK Nusa Mandiri Jakarta Depok
  • Muh. Jamil STMIK Nusa Mandiri Jakarta Depok
  • Surya Fajar Saputra STMIK Nusa Mandiri Jakarta Depok
Keywords: dijkstra's algorithm, shortest distance, graph, node, edge

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.

Downloads

Download data is not yet available.

Author Biographies

Windu Gata, STMIK Nusa Mandiri Jakarta Depok

STMIK Nusa Mandiri Jakarta Depok

Dwiza Riana, STMIK Nusa Mandiri Jakarta Depok

STMIK Nusa Mandiri Jakarta Depok

Published
2021-03-24
Section
Articles