@article{Paryati_Yazid_2014, title={Minimum Spanning Tree for the Implementation of Kruskal’s Algorithm}, volume={3}, url={https://ejournal.uin-suka.ac.id/saintek/ijid/article/view/03205}, DOI={10.14421/ijid.2014.03205}, abstractNote={<p><strong>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.</strong></p>}, number={2}, journal={IJID (International Journal on Informatics for Development)}, author={Paryati, Paryati and Yazid, Ahmad Subhan}, year={2014}, month={Dec.}, pages={29–34} }