The Application of Cruscal Algorithm in Determining the Shortest Routes Tourism in Medan

Penulis

  • Rismunanda Rismunanda Student of Mathematics Study Program, Faculty of Mathematics and Natural Sciences, Universitas Sumatera Utara Medan-Indonesia 20155
  • Normalina Napitupulu Mathematics Undergraduate Study Program

DOI:

https://doi.org/10.47662/farabi.v5i2.390

Kata Kunci:

kruskal, graph, shortest path, tourism, object

Abstrak

With technological advances today, the application of science in mathematics is becoming increasingly broad, including determining the optimal path on a path using a graph. As we know, the city of Medan and its surroundings is one of the tourist destinations in Indonesia, which has many interesting places to visit. Tourists inside and outside have even planned to visit various tourism centers in the city of Medan. With so many tourist objects to be visited, a graph will be very helpful in determining the paths that have the shortest path, the path that produces the least cost, and the path that is the most optimal. Kruskal's algorithm is an algorithm in graph theory that looks for the minimum spanning tree for a weighted and connected graph. Kruskal's algorithm is one of the algorithms for determining the shortest route from one tourist attraction to another.

Biografi Penulis

Normalina Napitupulu, Mathematics Undergraduate Study Program

Faculty of Mathematics and Natural Sciences, Universitas Sumatera Utara Medan-Indonesia 20155

Referensi

Annisa, F., & Muliani, F. (2019). Penerapan Algoritma Kruskal Dalam Sisrem Jaringan Listrik Di Kecamatan Langsa Baro. Ganna-Pi, 01(01), 2010–2012.

Des Welyyanti, dan, Matematika, J., & Matematika dan Ilmu Pengetahuan, F. (2021). Menentukan Minimum Spanning Tree Menggunakan Algoritma Modifikasi Dari Algoritma Prim Dan Kruskal Dalam Perencanaan Rute Wisata Yang Efisien Determining Minimum Spanning Tree By Using Modification Algorithm of Prim and Kruskal Algorithm in Efficient Touri. Jurnal Sains Dan Matematika Unpam, 3(2), 103–110. http://openjournal.unpam.ac.id/index.php/jsmu/article/download/6706/5933

Gunawan, G., & Cahyani, M. I. (2018). Penerapan Algoritma Kruskal Dalam Mencari Lokasi Anjungan Tunai Mandiri Bank Rakyat Indonesia Cabang Bengkulu Berbasis Android. Journal of Technopreneurship and Information System (JTIS), 1(2), 44–49. https://doi.org/10.36085/jtis.v1i2.31

Hayu, W., Yuliani, & Sam, M. (2017). Pembentukan Pohon Merentang Minimum Dengan Algoritma Kruskal. Jurnal Scientific Pinisi, Vol 3(1994), 108–115.

Mengetahui, A. K. U., Belajar, K., Berdasarkan, M., Program, M., Statistika, S., & Unpatti, F. (2020). Juan Charles Samuel Jamco 1 , Abdul Malik Balami 2* 1,2. 1(1), 39–44.

Priyono, P. (2021). Algoritma Kruskal Menentukan Lintasan Terpendek Efektif Call Salesman. FUSIOMA (Fundamental Scientifc Journal of …, 1(2), 25–33. https://jurnal.unupurwokerto.ac.id/index.php/fusioma/article/view/25%0Ahttps://jurnal.unupurwokerto.ac.id/index.php/fusioma/article/download/25/18

Wahyuningsih, D., & Syahreza, E. (2018). Shortest Path Search Futsal Field Location With Dijkstra Algorithm. IJCCS (Indonesian Journal of Computing and Cybernetics Systems), 12(2), 161. https://doi.org/10.22146/ijccs.34513

Unduhan

Diterbitkan

2022-09-10

Cara Mengutip

Rismunanda, R., & Napitupulu, N. (2022). The Application of Cruscal Algorithm in Determining the Shortest Routes Tourism in Medan . FARABI: Jurnal Matematika Dan Pendidikan Matematika , 5(2), 116–120. https://doi.org/10.47662/farabi.v5i2.390

Terbitan

Bagian

Articles