COMPERATIVE OF PRIM™S, KRUSKAL™S AND BORUVKA™S ALGORITMA TO SOLVE MINIMUM SPANNING TREE PROBLEMS

Authors

  • Faridawaty Marpaung MATH Faculty of MIPA The State University of Medan
  • Arnita Arnita MATH Faculty of MIPA The State University of Medan
  • Wirdatull Jannah Idris MATH Faculty of MIPA The State University of Medan

DOI:

https://doi.org/10.24114/jh.v10i2.16053

Abstract

Abstract. Optimization is important in an algorithm. It can save the operational costs of an activity. In the Minimum Spanning Tree, the goal is to achieve how all vertices are connected with the smallest weights. Several algorithms can calculate the use of weights in this. The purpose of this study is to find out the Primary electricity distribution network graph model and  correct algorithm to determine the minimum spanning tree. By comparing three algorithms, Prim™s, Boruvka™s and Kruskal™s algorithm, it will get an efficient algorithm to solve the minimum spanning tree problem. To get the output it takes several steps: Data collection: Designing Model: calculating the minimum spanning tree of Prim™s, the Boruvka™s and Kruskal™s algorithm: Comparing the efficiency of each algorithms. The analysis shows that the Prim™s and Bruvka™s and Kruskal™s algorithm have different steps even though the final result in the form of weights obtained in achieving the minimum spanning tree is the same. But in the case of electric network optimization, the Prim™s algorithm is more efficient in installing of primary electricity distribution in Gand Asia City at Labuhan Ruku by PT.PLN branch Tanjung Tiram, Batubara district. Keywords: Minimum spanning tree, Prim™s Algorithm, Boruvka™s Algorithm,Kruskal™s Algorithm Abstrak. Optimasi adalah hal penting dalam suatu algoritma. Ini dapat menghemat biaya operasional suatu kegiatan. di Minimum Spanning Tree, yang ingin dicapai adalah bagaimana semua vertex terhubung dengan bobot terkecil. Beberapa algoritma dapat menghitung penggunaan bobot dalam graf ini. Tujuan penelitian ini mengetahui Model graf jaringan distribusi listrik primer serta algoritma yang tepat untuk menentukan minimum spanning tree. Dengan membandingkan tiga buah algoritma yaitu algoritma Prim, algoritma Boruvaka dan algoritma Kruskal  akan diperoleh algoritma yang efisien menyelesaikan masalah nimimum spanning tree. Untuk mendapatkan outputnya diperlukan beberapa tahap:  Pengumpulan data : Merancang Model : Mencari minimum spanning tree dari algoritma Prim, algoritma Boruvka dan algoritma Kruskal : Membandingkan keefisienan masing masing algoritma. Dari hasil analisis menunjukkan bahwa algoritma Prim dan  algoritma Boruvka dan algoritma Kruskal memiliki langkah yang berbeda “ beda meskipun hasil akhir berupa bobot yang diperoleh dalam mencapai penyelesaian minimum spanning tree  adalah sama . Namun dalam kasus optimasi jaringan listrik algoritma Prim yang lebih efisien. untuk pemasangan distribusi listrik primer di Perumahan Grand Asia City di Labuhan Ruku oleh  PT.PLN cabang Tanjung Tiram Kabupaten Batubara. Kata Kunci : Minimum spanning tree, Algoritm Prim, Algoritma Boruvka , Algoritma Kruskal

Author Biographies

Faridawaty Marpaung, MATH Faculty of MIPA The State University of Medan

MATH Faculty of MIPA The State University of Medan

Arnita Arnita, MATH Faculty of MIPA The State University of Medan

MATH Faculty of MIPA The State University of Medan

Wirdatull Jannah Idris, MATH Faculty of MIPA The State University of Medan

MATH Faculty of MIPA The State University of Medan

Downloads

Published

2019-12-20

How to Cite

Marpaung, F., Arnita, A., & Idris, W. J. (2019). COMPERATIVE OF PRIM™S, KRUSKAL™S AND BORUVKA™S ALGORITMA TO SOLVE MINIMUM SPANNING TREE PROBLEMS. JURNAL HANDAYANI PGSD FIP UNIMED, 10(2), 80–89. https://doi.org/10.24114/jh.v10i2.16053

Issue

Vol. 10 No. 2: December 2019

Section

Articles

License

Copyright (c) 2019 Faridawaty Marpaung, Arnita Arnita, Wirdatull Jannah Idris

Creative Commons License

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

Authors published with the Handayani PGSD FIP UNIMED Journal agree to the following terms:

  1. Authors retain copyright and grant the journal the right of first publication with the work simultaneously licensed under a Creative Commons Attribution License (CC BY-SA 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. (See The Effect of Open Access)