# Pengoptimalan Jaringan Listrik dengan Minimum Spanning Tree

Abstract: One of mathematics branch that have many application in daily life is graph theory. Graph theory is used to link the relationship between a set of objects with a set of other objects. The set can be human, town, animal, or others. Graph is used to represent discrete objects and links between them. One of the interesting topic in graph theory is the spanning tree. Spanning tree can determined the shortest route in a city, optimize the telephone network, the installation of water pipes in a house, optimizing the electrical network, and other examples. In the electrical network, the minimum spanning tree determines that the results obtained can help save the cost and length of the cable in the installation process. In this case, we used Kruskal’s and Prim’s algorithm to obtain optimal results.
Keywords: electrical network, the minimum spanning tree, Kruskal’s algorithm, Prim's algorithm
Penulis: Dwiprima Elvanny Myori
Kode Jurnal: jptlisetrodd150864