IJID (International Journal on Informatics for Development)
Vol 3, No 2 (2014): IJID December

Minimum Spanning Tree for the Implementation of Kruskal’s Algorithm

Paryati, Paryati (Unknown)
Yazid, Ahmad Subhan (Unknown)

Article Info

Publish Date
26 Dec 2014

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.

Copyrights © 2014




Citation Download
RIS
EndNote, Reference Manager, ProCite
BibTex
Latex, Jabref
Full PDF
641.784 KB
Original Source
Download Original
Google Scholar
Check in Google Scholar
Journal Info
IJID (International Journal on Informatics for Development)
Website

Abbrev

ijid

Publisher

Universitas Islam Negeri Sunan Kalijaga Yogyakarta

Subject

Computer Science & IT

Description

One important point in the accreditation of higher education study programs is the availability of a journal that holds the results of research of many investigators. Since the year 2012, Informatics Department has English language. Journal called IJID International Journal on Informatics for ...