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

  • Ricky Aditya Universitas Sanata Dharma
Keywords: Kruskal's algorithm, Prim's algorithm, weighted graph, minimum spanning tree

Abstract

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.

References

[1] R. J. Wilson, Pengantar Teori Graf, Edisi Kelima, Jakarta : Penerbit Erlangga, 2010.
[2] S. S. Epp, Discrete Mathematics with Applications, 4th ed. Belmont : Brooks/Cole Publishing Co.
[3] P. Biswas, M. Goel, H. Negi, and M. Datta, “An Efficient Greedy Minimum Spanning Tree Algorithm Based on Vertex Associative Cycle Detection Method,” Procedia Computer Science, vol. 92, pp. 513-519, 2016.
[4] J. H. S. Alkhalissi, A. Sayli, “Negligence Minimum Spanning Tree Algorithm,” European Journal of Science and Technology, vol. 14, pp. 70-76, 2018.
[5] B. M. E. Moret and H. D. Shapiro, “An Empirical Analysis of Algorithms for Constructing a Minimum Spanning Tree,” in 2nd Workshop on Algorithm and Data Structures (WADS), 1991, pp. 400-411
Published
2019-09-13
How to Cite
Aditya, R. (2019). ALGORITMA “HANCURKAN SEMUA SIKEL” UNTUK MENENTUKAN POHON PERENTANG MINIMUM DARI SUATU GRAF BERBOBOT. Jurnal Ilmiah Matrik, 21(2), 91-98. https://doi.org/10.33557/jurnalmatrik.v21i2.571
Section
Articles
Abstract viewed = 29 times
PDF : 13 times