Article Per Year (5 Year)
p-Index From 2021 - 2026
0.61
P-Index
This Author published in this journals
All Journal Jurnal Ilmiah Matrik Komputasi: Jurnal Ilmiah Ilmu Komputer dan Matematika International Journal of Applied Sciences and Smart Technologies Pattimura Proceeding : Conference of Science and Technology
Ricky Aditya
Universitas Sanata Dharma
Agriculture, Biological Sciences & Forestry Astronomy Biochemistry, Genetics & Molecular Biology Chemical Engineering, Chemistry & Bioengineering Chemistry Civil Engineering, Building, Construction & Architecture Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Energy Engineering Industrial & Manufacturing Engineering Materials Science & Nanotechnology Mathematics Physics

Published : 5 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search
Journal : Jurnal Ilmiah Matrik

 1 
ALGORITMA “HANCURKAN SEMUA SIKEL” UNTUK MENENTUKAN POHON PERENTANG MINIMUM DARI SUATU GRAF BERBOBOT Ricky Aditya
Jurnal Ilmiah Matrik Vol 21 No 2 (2019): Jurnal Ilmiah Matrik
Publisher : Direktorat Riset dan Pengabdian Pada Masyarakat (DRPM) Universitas Bina Darma

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.33557/jurnalmatrik.v21i2.571

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.
Co-Authors Boris Skoric Maria Vianney Any Herawati Priscila Septinina Henryanti