PENCARIAN POHON PERENTANG MINIMUM PADA JARINGAN LISTRIK BANGUNAN DENGAN MENGGUNAKAN ALGORITMA KRUSKAL

Yuniarto Bagas Wibisono, Yuniarto Bagas Wibisono, YB Dwi Setianto

Abstract


The minimum spanning tree can be used to solve the problems in the graph. An example of a graph problem can be found in a building's electrical network.This project discusses the analysis of Kruskal algorithm on the building plan. The building plan that has been obtained is then done by mapping with switches and socket as nodes and cables as edges. After testing the obtained data, it can be concluded that the Kruskal algorithm can be used to determine the minimum spanning tree.

Keywords


minimum spanning tree, kruskal, electrical

Full Text:

PDF

References


A. Z. Wattimena and S. Lawalatta, “APLIKASI ALGORITMA KRUSKAL DALAM PENGOTIMALAN PANJANG PIPA,” BAREKENG: Jurnal Ilmu Matematika dan Terapan, vol. 7, no. 2, Art. no. 2, 2013.

D. Kurniawan, W. Wamiliana, and C. S. N. Fauzi, “perbandingan kompleksitas algoritma prim, algoritma kruskal, dan algoritma sollin untuk menyelesaikan masalah minimum spanning tree,” Jurnal Komputasi, vol. 2, no. 1, Art. no. 1, Sep. 2016, doi: 10.23960/komputasi.v2i1.1005.

W. Anggraeni, “APLIKASI ALGORITMA SOLLIN DALAM PENCARIAN POHON PERENTANG MINIMUM PROVINSI JAWA TENGAH,” Faktor Exacta, vol. 8, no. 4, Art. no. 4, Dec. 2015, doi: 10.30998/faktorexacta.v8i4.508.

U. Latifah and E. Sugiharti, “PENERAPAN ALGORITMA PRIM DAN KRUSKAL PADA JARINGAN DISTRIBUSI AIR PDAM TIRTA MOEDAL CABANG SEMARANG UTARA,” Unnes Journal of Mathematics, vol. 4, no. 1, Art. no. 1, May 2015, doi: 10.15294/ujm.v4i1.7418.




DOI: https://doi.org/10.24167/proxies.v2i1.3198

Copyright (c) 2021 PROXIES



View My Stats