Perbandingan Algoritma Kruskal dan Prim dalam Menentukan Minimum Spanning Tree untuk Optimasi Jaringan Distribusi Listrik
Abstract
This study aims to compare the performance of the Kruskal and Prim algorithms in solving the Minimum Spanning Tree (MST) problem for the PLN UP3 Cimahi electricity distribution network using Python-based Google Colab. The study employs an applied research methodology, utilising data on the lengths of electricity network cables modelled as a weighted graph. The analysis was carried out using the NetworkX library on Google Colab to construct the MST using both algorithms. The results show that both algorithms produced the same total MST weight of 1,258.05 metres, which is less than the initial network length of 1,424.61 metres, resulting in an efficiency of 11.69 per cent. Although they produced identical solutions, the Kruskal algorithm is simpler to apply to networks with a large number of nodes because the weight sorting process is carried out at the beginning. This study demonstrates that Google Colab is an effective platform for both learning and implementing graph theory-based network optimisation.
Full text article
References
Abhisyeka, B., Bagaskara, J. A., Valensy, I., Permana, R. H. P., & Suroni, A. (2025). Minimum Spanning Tree Approach for Optimization and Clustering: Algorithms, Applications, and Comparisons. Journal of Advanced Systems Intelligence and Cybersecurity, 1(01).
Alham, N. R., Budiasih, A. F., Utomo, R. M., Muslimin, M., & Wirawan, A. P. (2024). Studi Konservasi Energi Pada Beban Rumah Tangga Dalam Upaya Efisiensi Penggunaan Energi Listrik. JTEIN: Jurnal Teknik Elektro Indonesia, 5(2), 309–320.
Didiharyono, D., & Soraya, S. (2018). Penerapan Algoritma Greedy Dalam Menentukan Minimum Spanning Trees Pada Optimisasi Jaringan Listrik Jala. Jurnal VARIAN, 1(2), 1–10. https://doi.org/10.30812/varian.v1i2.66
Fitriana, R. (2014). Perbandingan Algoritma Prim dan Kruskal untuk Menyelesaikan Masalah Spanning Tree. Procedia Manufacturing, 1(22 Jan), 1–17.
Julistia, A., & Mardhotillah, B. (2025). Pengoptimalan Pendistribusian Jaringan Listrik Menggunakan Kruskal Algorithm. JISTech (Journal of Islamic Science and Technology), 10(1), 64–71.
Munir, R. (2016). Matematika Diskrit (Edisi Ketiga. Informatika.
Niluminda, K. P. O., & EMUSB, E. (2022). An efficient method to solve minimum spanning tree problem using graph theory and improved ant colony optimization algorithm. North American Academic Research, 5(12), 34–43.
Nugraha, D. W. (2011). Aplikasi algoritma prim untuk menentukan minimum spanning tree suatu graf berbobot dengan menggunakan pemrograman berorientasi objek. Foristek, 1(2).
Nurlinawati Dili, Y., Wulan, E. ., & Ilahi, F. (2021). Penyelesaian Masalah Transportasi untuk Mencari Solusi Optimal dengan Pendekatan Minimum Spanning Tree (MST) Menggunakan Algoritma. Academia.Edu.
Rofiq, N., & Sitio, S. L. M. (2024). Pengenalan Dasar Analisis Data dengan Python di Google Colab.
Ruhimat, Q. A. A., Slamin, S., & Malinda, A. (2024). Efektivitas Algoritma Kruskal dalam Mengoptimalkan Jalur Terpendek pada Jaringan Intranet. Jurnal Sains Natural, 2(3), 59–67.
Sembiring, R. R. (2022). Penerapan Algoritma Prim dalam Menentukan Minimum Spanning Tree (MST)(Studi Kasus: Jaringan Pipa PDAM Tirta Muaro Jambi). Universitas Jambi.
Simbolon, A. F. A. (2021). Aplikasi Minimum Spanning Tree pada Jaringan Listrik dI Desa Simatorkis Kecamatan Dolok Kabupaten Paluta. Unimed.
Situmorang, Y. M., & Mansyur, A. (2023). Pengoptimalan Jaringan Pipa Primer PDAM Tirtanadi Cabang Tuasan Dengan Menggunakan Algoritma Kruskal. Jurnal RIiset Rumpun Matematika Dan Ilmu Pengetahuan Alam, 2(2), 221–237.
Wamiliana, W., Usman, M., Warsito, W., Warsono, W., & Daoud, J. I. (2020). Using Modification of Prim’s Algorithm and Gnu Octave and to Solve the Multiperiods Installation Problem. IIUM Engineering Journal, 21(1), 100–112.
Authors
Copyright (c) 2026 Euis Sartika, Anie Lusiani
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution-NonCommercial 4.0 International License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
- 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.
- 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