Minimum Spanning Tree for the Implementation of Kruskal’s Algorithm

Paryati Paryati, Ahmad Subhan Yazid

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.


Keywords


Algorithm; Graph; Kruskal’s; Spanning Tree

Full Text:

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.




DOI: http://dx.doi.org/10.14421/ijid.2014.03205

Refbacks

  • There are currently no refbacks.


Copyright (c) 2019 IJID (International Journal on Informatics for Development)

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

 

ISSN: 2252-7834 (print) | 2549-7448 (online)

International Journal on Informatics for Development

Office : Informatics Dept. Faculty of Science and Technology,

State Islamic University (UIN) Sunan Kalijaga,

Yogyakarta-Indonesia

Marsda Adisucipto Street, Yogyakarta

Phone +62-274 519739 Fax. +62-274 540971

Email : ijid@uin-suka.ac.id

Creative Commons License

All publications

by International Journal on Informatics for Development are licensed under a

Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License