Pendekatan Matriks Ketetanggaan Berbobot untuk Solusi Minimum Spanning Tree (MST)

Minimum Spanning Tree (MST) or often called Minimum Weighting Spanning Tree (MWST) is a path or edge search algorithm that connects all vertices in a connected graph and does not form a circuit with a minimum weight. The classic algorithm used to solve MST problems is the P rim ’s and Kruskal’s algorithm s . The problem of minimum spanning tree is a problem related to optimization in finding the minimum weighted edge that can connect all vertices). MST is widely used in computer science such as to determin e access points, build networks and many more. The purpose of this reserarch is to find new solutions that can provide alternative MST solutions besides classical algorithms such as P rim and K ruskal. This experimental research uses a weighted adjacency matrix approach , with weight taken from the minimum side in each pair of matrix to produce a minimum spanning tree . T his new solution can be an alternative in solving the minimum spanning tree problem s .