IMPLEMENTASI ALGORITMA KRUSKAL DAN ALGORITMA PRIM SUATU GRAPH DENGAN APLIKASI BERBASIS DESKTOP
Keywords:Kruskal, Prim, Graph, Algoruthm, Desktop Aplication
A graph has several algorithms in its solution, including the Kruskal algorithm and Prim algorithm, both of which are greedy algorithms for determining the minimum spanning tree. Completion of graphs is useful in various fields of life, so an accurate graph calculation is important. Making an application to solve a graph, especially the Kruskal algorithm and Prim algorithm aims to facilitate the work of the graph so as to produce an accurate final result. The flow of research carried out are: a background review of research, study of literature and relevant literature, application design, building desktop-based applications, as well as implementation and application tests. The level of technological readiness or TKT in this research is based on self-assessment which is at level 7, meaning the prototype demonstration system in the actual environment, with details of the TKT indicators as follows: TKT indicator 1 is met, TKT indicator 2 is met, TKT indicator 3 is not met, TKT indicator 4, TKT indicator 5 are met, TKT indicator 6 are met, TKT indicator 7 is met, TKT indicator 8 and 9 are not met. The application that has been built is useful for completing a graph with the Kruskal algorithm and Prim algorithm. This research was conducted to answer the crucial needs of a weighted graph settlement application.
S. R. Abdullah-Al Mamun, "An Efficient Minimum Spanning Tree Algorithm," IEEE Symposium on Computers and Communication (ISCC), p. 6, 2016.
W. Chen, Applied Graph Theory, London: North Holland Publishing Company, 1971.
Q. X. Y. W. Haiming Li, "Research and Improvement of Kruskal Algorithm," Journal of Computer and Communications, p. 7, 2017.
Y. Marwan Sam, "PENERAPAN ALGORITMA PRIM UNTUK MEMBANGUN POHON MERENTANG MINIMUM (MINIMUM SPANNING TREE) DALAM PENGOPTIMALAN JARINGAN TRANSMISI NASIONAL PROVINSI SULAWESI SELATAN," Jurnal Dinamika, p. 12, 2016.
D. K. M. P. Nimesh Patel, "A Survey on: Enhancement of Minimum Spanning Tree," Nimesh Patel Int. Journal of Engineering Research and Applications, p. 5, 2015.
E. M. Riham Moharam, "Genetic algorithms to balanced tree structures in graphs," Swarm and Evolutionary Computation, p. 8, 2015.
G. E. Shimon Even, Graph Algorithm 2nd Edition, New York: Cambridge University Press, 2012.
M. A. M. A. I. M. A. I. Badri Munier, "A Fast Implementation of Minimum Spanning Tree Method and Applying it to Kruskals and Prims Algorithms," Sukkur IBA, vol. 1, no. Jun 2017, pp. 57-66, 2017.
I. M. Rafid, "Performance evaluation for Kruskals and Prims Algorithm in Minimum Spanning Tree using Networkx Package and Matplotlib to visualizing the MST Result," 2020.
Q. L. W. W. Buchuan Wang, "Prim Algorithm Based on Heap for Finding Minimal Spanning Tree of Ventilation Network," ASEI, pp. 1-6, 2015.
How to Cite
Copyright (c) 2020 Siti Alvi Sholikhatin, Adi Budi Prasetyo , Ade Nurhopipah
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
Copyright in each article belongs to the author.
- The authors admit that RESISTOR Journal as a publisher who published the first time under Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0) License.
- Authors can include writing separately, regulate distribution of non-ekskulif of manuscripts that have been published in this journal into another version (eg sent to respository institution author, publication into a book, etc.), by recognizing that the manuscripts have been published for the first time in RESISTOR Journal