Claim Missing Document
Check
Articles

Found 1 Documents
Search
Journal : IJID (International Journal on Informatics for Development)

Minimum Spanning Tree for the Implementation of Kruskal’s Algorithm Paryati, Paryati; Yazid, Ahmad Subhan
IJID (International Journal on Informatics for Development) Vol 3, No 2 (2014): IJID December
Publisher : Universitas Islam Negeri Sunan Kalijaga Yogyakarta

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (641.784 KB) | DOI: 10.14421/ijid.2014.03205

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.