ALGORITMA “HANCURKAN SEMUA SIKEL” UNTUK MENENTUKAN POHON PERENTANG MINIMUM DARI SUATU GRAF BERBOBOT

Ricky Aditya (Universitas Sanata Dharma)

Jurnal Ilmiah Matrik
Vol 21 No 2 (2019): Jurnal Ilmiah Matrik

The minimum spanning tree is one of the applications of graph theory in various fields. There are several algorithms for determining the minimum spanning tree of a weighted graph, such as Kruskal's algorithm and Prim's algorithm. These two algorithms are not really easy to teach to students in general. Therefore in this paper presented an alternative algorithm called the algorithm "Destroy All Sikel", which is more intuitive and easier to understand. Furthermore, there are also examples of implementation and comparison with two other algorithms.