Minimum Spanning Tree for the Implementation of Kruskal’s Algorithm
Vol. 3 No. 2 (2014), Articles
Vol. 3 No. 2 (2014)

Minimum Spanning Tree for the Implementation of Kruskal’s Algorithm

Articles
https://doi.org/10.14421/ijid.2014.03205
Published 2014-12-26
Paryati Paryati
Departement of Informatics Engineering Faculty of Industrial Engineering University Pembangunan Nasional ”Veteran” Yogyakarta
Ahmad Subhan Yazid
Department of Informatics, Faculty of Science and Technology, UIN Sunan Kalijaga, Yogyakarta
PDF

Keywords

Algorithm
Graph
Kruskal’s
Spanning Tree

How to Cite

Paryati, P., & Yazid, A. S. (2014). Minimum Spanning Tree for the Implementation of Kruskal’s Algorithm. IJID (International Journal on Informatics for Development), 3(2), 29–34. https://doi.org/10.14421/ijid.2014.03205
ACM ACS APA ABNT Chicago Harvard IEEE MLA Turabian Vancouver

Download Citation

Endnote/Zotero/Mendeley (RIS) BibTeX

Abstract

Kruskal’s algorithm is an algorithm used to find a minimum spanning tree in graph connectivity which gives an option to keep processing the edge limit with the least weight. In a Kruskal’s algorithm, the weight sorting of edge value will ease the finding of the shortest path. This algorithm has independent nature which will ease and enhance the path track making.

https://doi.org/10.14421/ijid.2014.03205
PDF

References

R. Johnsonbaugh, Discrete Mathematics, Seventh. Pearson Prentice Hall, 2009.

G. Brassard and P. Bratley, Fundamental of Algorithmics. Pearson, 1995.

B. R. Preiss, Data Structures and Algorithms with Object-Oriented Design Patterns in Java. John Wiley & Sons, 1999.

Creative Commons License
IJID (International Journal on Informatics for Development) is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License