Minimum Spanning Tree for the Implementation of Kruskal’s Algorithm
| Main Authors: | Paryati, Paryati, Yazid, Ahmad Subhan |
|---|---|
| Format: | Article info application/pdf Journal |
| Bahasa: | eng |
| Terbitan: |
Universitas Islam Negeri Sunan Kalijaga Yogyakarta
, 2014
|
| Subjects: | |
| Online Access: |
http://ejournal.uin-suka.ac.id/saintek/ijid/article/view/1575 http://ejournal.uin-suka.ac.id/saintek/ijid/article/view/1575/1490 |
Daftar Isi:
- 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.