The Implementation of Kruskal’s Algorithm for Minimum Spanning Tree in a Graph

Kruskal’s Algorithm is an algorithm used to find the minimum spanning tree in graphical connectivity that provides option continue processing least-weighted margins. In Kruskal algorithm, ordering weight of ribs makes it easy shortest path. This independent nature which will facilitate and improve path creation. Based on results application system trials have been carried out testing comparisons between Dijkstra following conclusions can be drawn: a strength existence sorting search for And considering characteristics formation The weakness if number nodes very large, slower than Dijkstra’s because has sort thousands vertices first, then form