PROJECT REPORT MINIMUM SPANNING TREE ON A BUILDING ELECTRICAL NETWORK USING KRUSKAL ALGORITHM
Daftar Isi:
- 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. Less than optimal network installation can lead to cost swelling which can be allocated to other fields. 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. The result of the kissing of the Kruskal algorithm is the same as the manual counting result without the aid of the program. Keyword: minimum spanning tree, kruskal, electrical