Authors:

RENDI SAPUTRAMA, HARTATIANA HARTATIANA

Abstract:

“Finding the shortest direction is one of the options that have been considered while traveling. One of the problems that occur for lecturers, staff, and students of UIN Raden Fatah is determining the shortest direction from Campus A to B. The application of graph theory by using Dijkstra’s Algorithm becomes a solution for this problem. This algorithm has the advantage to minimize the expense of the costs by finding the shortest route from starting point to the destination. This study is applied research. The study will discuss the determination of the origin and destination end-point, traverse route, the calculation of the weight distance, analyzes the Dijkstra’s iteration to determine the shortest route, and conclusion. As the result, the land route becomes the shortest route option from UIN Raden Fatah Campus A to B. The directed graph of the route represents the location as point, the road as the side, and distance as weight. The result shows that the route distance is 6.94 km using Dijkstra’s Algorithm.”

Keywords

Keyword Not Available

Downloads:

Download data is not yet available.

References

References Not Available

PDF:

https://jurnal.harianregional.com/mtk/full-73403

Published

2021-09-14

How To Cite

SAPUTRAMA, RENDI; HARTATIANA, HARTATIANA. APLIKASI ALGORITMA DIJKSTRA UNTUK MENENTUKAN RUTE TERPENDEK DARI KAMPUS A KE B UIN RADEN FATAH.E-Jurnal Matematika, [S.l.], v. 10, n. 3, p. 173-178, sep. 2021. ISSN 2303-1751. Available at: https://jurnal.harianregional.com/mtk/id-73403. Date accessed: 28 Aug. 2025. doi:https://doi.org/10.24843/MTK.2021.v10.i03.p339.

Citation Format

ABNT, APA, BibTeX, CBE, EndNote - EndNote format (Macintosh & Windows), MLA, ProCite - RIS format (Macintosh & Windows), RefWorks, Reference Manager - RIS format (Windows only), Turabian

Issue

Vol 10 No 3 (2021)

Section

Articles

Creative Commons License This work is licensed under a Creative Commons Attribution 4.0 International License