Pencarian Pohon Perentang Minimum Pada Jaringan Listrik Bangunan Dengan Menggunakan Algoritma Kruskal

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.