Implementasi Algoritma Dijkstra Untuk Pencarian Rute Terpendek Ke Museum Mulawarman Tenggarong

Authors

  • Kusnadi Program Studi Teknik Informatika, Universitas Nahdlatul Ulama Kalimantan Timur
  • Muhammad Syahroni Program Studi Sistem Informasi, STMIK Samarinda

DOI:

https://doi.org/10.30605/proximal.v8i1.4896

Keywords:

Algoritma Dijkstra, Museum Mulawarman, Teori graf

Abstract

Masalah jarak dan kesulitan dalam menentukan rute adalah tantangan umum yang dihadapi oleh banyak orang ketika mengunjungi lokasi tertentu. Algoritma Dijkstra diimplementasikan untuk menghitung jarak terpendek dari titik tertentu ke Museum Mulawarman yang dipilih sebagai tujuan destinasi wisata. Implementasi algoritma Dijkstra ini dirancang untuk mengoptimalkan pencarian rute menuju museum dengan bobot jarak terpendek di Tenggarong Kutai Kartanegara. Proses pencarian ini dapat diselesaikan menggunakan metode algoritma Dijkstra, sehingga kita dapat memahami tahapan proses perhitungan dengan metode tersebut. Algoritma Dijkstra digunakan untuk menemukan jalur terpendek dalam bentuk graf yang memiliki bobot dan pemetaan area yang saling terhubung melalui jalur yang sudah ditentukan. Penelitian ini bertujuan untuk menentukan rute terpendek dari titik tertentu menuju ke Museum Mulawarman Tenggarong. Berdasarkan pengujian yang dilakukan, penerapan algoritma Dijkstra untuk menemukan rute terpendek menuju ke Museum Mulawarman ini menjadi informasi bagi pengunjung agar efektif dan optimal.

References

Downloads

Published

2025-01-13

Issue

Vol. 8 No. 1 (2025): Integrasi Matematika, Teknologi, dan Budaya dalam Pendidikan dan Aplikasi Terapan

Section

Articles

License

In submitting the manuscript to the journal, the authors certify that:

  • They are authorized by their co-authors to enter into these arrangements.
  • The work described has not been formally published before, except in the form of an abstract or as part of a published lecture, review, thesis, or overlay journal.
  • That it is not under consideration for publication elsewhere,
  • That its publication has been approved by all the author(s) and by the responsible authorities – tacitly or explicitly – of the institutes where the work has been carried out.
  • They secure the right to reproduce any material that has already been published or copyrighted elsewhere.
  • They agree to the following license and copyright agreement.

License and Copyright Agreement

Authors who publish with this journal agree to the following terms:

  1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under Creative Commons Attribution License (CC BY 4.0) that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
  2. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
  3. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.

How to Cite

Implementasi Algoritma Dijkstra Untuk Pencarian Rute Terpendek Ke Museum Mulawarman Tenggarong. (2025). Proximal: Jurnal Penelitian Matematika Dan Pendidikan Matematika, 8(1), 244-253. https://doi.org/10.30605/proximal.v8i1.4896