Published: 2023-07-01
Visualisasi Algoritma Kruskal dan Prim dalam Mencari Rute Terpendek Berbasis Unity 3D
DOI: 10.35870/jtik.v7i3.866
William Chrisnando Ekasaputra, Magdalena A. Ineke Pakereng
-
William Chrisnando Ekasaputra:
Satya Wacana Christian University
- Magdalena A. Ineke Pakereng: Dosen Universitas Kristen Satya Wacana
Abstract
Kruskal and Prim algorithms are two Minimum Spanning Tree search algorithms on a graph that has similarities. With the speedy development of technology, a new learning media emerged, namely games. This research was conducted to design and test a game that can explain and visualize how Kruskal and Prim's algorithm works. The result of this research is expected to prove the efficiency of learning Kruskal and Prim algorithm easier and at better efficiency than traditional way of studying. The data in this research originated from a questionnaire distributed to game users who are still students or students. The results showed an increasing number of game users who understood the Kruskal and Prim algorithms.
Keywords
Education Game; Minimum Spanning Tree; Kruskal Algorithm; Prim Algorithm; Unity 3D
Article Information
This article has been peer-reviewed and published in the Jurnal JTIK (Jurnal Teknologi Informasi dan Komunikasi). The content is available under the terms of the Creative Commons Attribution 4.0 International License.
-
Issue: Vol. 7 No. 3 (2023)
-
Section: Computer & Communication Science
-
Published: 2023-07-01
-
License: CC BY 4.0
-
Copyright: © 2023 Authors
-
DOI: 10.35870/jtik.v7i3.866
AI Research Hub
This article is indexed and available through various AI-powered research tools and citation platforms. Our AI Research Hub ensures that scholarly work is discoverable, accessible, and easily integrated into the global research ecosystem.
William Chrisnando Ekasaputra, Satya Wacana Christian University
Program Studi Sistem Komputer, Fakultas Teknik, Universitas Kristen Satya Wacana, Kota Salatiga, Provinsi Jawa Tengah, Indonesia
Magdalena A. Ineke Pakereng, , Dosen Universitas Kristen Satya Wacana
Program Studi Sistem Komputer, Fakultas Teknik, Universitas Kristen Satya Wacana, Kota Salatiga, Provinsi Jawa Tengah, Indonesia
-
Lubis, H. and Srisulistiowati, D.B., 2021. Algoritma Prim Dan Kruskal Dalam Mencari Minimum Spanning Tree Pada Bahasa Pemrograman C. JSI (Jurnal sistem Informasi) Universitas Suryadarma, 8(2), pp.1-14. DOI: https://doi.org/10.35968/jsi.v8i2.711.
-
Harlanto, R.A. 2020. Berkenalan Dengan FITUR-FITUR Unity 3D: Berita: Gamelab Indonesia, Gamelab.id. Available at: https://www.gamelab.id/news/211-berkenalan-dengan-fitur-fitur-unity-3d.
-
N., S.M.K.H. 2020. Minimum Spanning Tree, Minimum Spanning Tree OmahTI UGM. Available at: https://omahti.web.id/post/minimum-spanning-tree.
-
Inayah, K. 2020. Efektivitas Pembelajaran Matematika Melalui Media Pembelajaran Berbasis Komputer Model Games Pada Siswa Kelas Vii Smp Muhammadiyah Makassar. Universitas Muhammadiah Makassar. Available at: https://digilibadmin.unismuh.ac.id/upload/10486-Full_Text.pdf.
-
Kusumawati, E.R., 2022. Efektivitas media game berbasis scratch pada pembelajaran IPA sekolah dasar. Jurnal Basicedu, 6(2), pp.1500-1507. DOI: https://doi.org/10.31004/basicedu.v6i2.2220.
-
Ambarwati, M., 2019. Efektivitas Media Pembelajaran Berbasis Web Game untuk Meningkatkan Kemampuan Pemecahan Masalah pada Pembelajaran Matematika SD. Mimbar Pgsd Undiksha, 7(2). DOI: https://doi.org/10.23887/jjpgsd.v7i2.17472.
-
Fauzi, B.M. 2019. Rancang Bangun Aplikasi Game Djarkom (Dasar Jaringan Komputer) Menggunakan Unity 3D Berbasis Android. Universitas Negeri Semarang. Available at: http://lib.unnes.ac.id/36886/1/5302412124_Optimized.pdf.
-
Chrisnanda, D.H. 2017. Efektifitas Pembelajaran dengan Game Edukasi terhadap Minat Belajar Siswa: Studi Kasus SMP N 2 Gunungwungkal, Pati. Universitas Kristen Satya Wacana. Available at: https://repository.uksw.edu//handle/123456789/13964.
-
Marsudi. 2016. Teori Graf. Universitas Brawijaya Press.
-
Dili, Y.N. 2021. Penyelesaian Masalah Transportasi Untuk Mencari Solusi Optimal Dengan Pendekatan Minimum Spanning Tree (Mst) Menggunakan Algoritma Kruskal Dan Algoritma Prim, KUBIK: Jurnal Publikasi Ilmiah Matematika, 6(1), pp. 44–50. DOI: https://doi.org/10.15575/kubik.v6i1.13907.
-
Sholikhatin, S.A., Prasetyo, A.B. and Nurhopipah, A., 2020. IMPLEMENTASI ALGORITMA KRUSKAL DAN ALGORITMA PRIM SUATU GRAPH DENGAN APLIKASI BERBASIS DESKTOP. Jurnal RESISTOR (Rekayasa Sistem Komputer), 3(2), pp.89-93. DOI: https://doi.org/10.31598/jurnalresistor.v3i2.638.
-
Chang, W.C., Chiu, Y.D. and Li, M.F., 2008. Learning Kruskal’s Algorithm, Prim’s Algorithm and Dijkstra’s Algorithm by board game. In Advances in Web Based Learning-ICWL 2008: 7th International Conference, Jinhua, China, August 20-22, 2008. Proceedings 7 (pp. 275-284). Springer Berlin Heidelberg. DOI: https://doi.org/10.1007/978-3-540-85033-5_27.
-
Yang, C. and Ren, C., 2010, July. Simulation research of communication networks based on Prim algorithm. In 2010 International Forum on Information Technology and Applications (Vol. 3, pp. 3-6). IEEE. DOI: https://doi.org/10.1109/IFITA.2010.35.
-
Yasin, M. and Afandi, B., 2014. Simulasi Minimum Spanning Tree Graf Berbobot Menggunakan Algoritma Prim dan Algoritma Kruskal. Jurnal Educazione: Jurnal Pendidikan, Pembelajaran dan Bimbingan dan konseling, 2(2). DOI: https://doi.org/10.0034/edu.v2i2.133
-
Afrianti, A., Effendi, E. and Welyyanti, D. 2021. Menentukan Minimum Spanning Tree Menggunakan Algoritma Modifikasi Dari Algoritma Prim Dan Kruskal Dalam Perencanaan Rute Wisata Yang Efisien, Jurnal Saintika Unpam : Jurnal Sains dan Matematika Unpam, 3(2), p. 103. DOI: https://doi.org/10.32493/jsmu.v3i2.6706.
-
Putu, D.N. and Fitriyanto, M.N., 2021. PERBANDINGAN ALGORITMA PRIM, KRUSKAL, DJIKSTRA, DAN FLOYD-WARSHALL UNTUK MEMECAHKAN MASALAH MINIMUM SPANNING TRESS: Perancangan Pemasangan Pipa Saluran Air Bersih: Comparison Of Prim, Kruskal, Djikstra, And Floyd-Warshall Algorithms To Solve Minimum Spanning Tree Problems: Design Of Clean Water Pipeline Installation. Bitnet: Jurnal Pendidikan Teknologi Informasi, 6(2), pp.17-24. DOI: https://doi.org/10.33084/bitnet.v6i2.2636.
-
Ayegba, P.O. et al. 2020. Comparative Performance Analysis of Kruskal and Prim MST Algorithms, International Journal of Engineering Research and Technology, 13(12), pp. 5386–5391.
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
Authors who publish with this journal agree to the following terms:
1. Copyright Retention and Open Access License
Authors retain copyright of their work and grant the journal non-exclusive right of first publication under the Creative Commons Attribution 4.0 International License (CC BY 4.0).
This license allows unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
2. Rights Granted Under CC BY 4.0
Under this license, readers are free to:
- Share — copy and redistribute the material in any medium or format
- Adapt — remix, transform, and build upon the material for any purpose, including commercial use
- No additional restrictions — the licensor cannot revoke these freedoms as long as license terms are followed
3. Attribution Requirements
All uses must include:
- Proper citation of the original work
- Link to the Creative Commons license
- Indication if changes were made to the original work
- No suggestion that the licensor endorses the user or their use
4. Additional Distribution Rights
Authors may:
- Deposit the published version in institutional repositories
- Share through academic social networks
- Include in books, monographs, or other publications
- Post on personal or institutional websites
Requirement: All additional distributions must maintain the CC BY 4.0 license and proper attribution.
5. Self-Archiving and Pre-Print Sharing
Authors are encouraged to:
- Share pre-prints and post-prints online
- Deposit in subject-specific repositories (e.g., arXiv, bioRxiv)
- Engage in scholarly communication throughout the publication process
6. Open Access Commitment
This journal provides immediate open access to all content, supporting the global exchange of knowledge without financial, legal, or technical barriers.