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

Paryati Paryati,Krit Salahddine,S Krit

doi:10.1051/matecconf/202134801001

Abstract

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

Highlights

The theories about graphs began in 1736 and several important discoveries in graph theory were obtained in the 19th century, but not until the 1920s that the interest in graph theory bloomed
One of the reasons for interest in graph theory is due to its application in many fields, including computer science, chemistry, operation research, electrical engineering, linguistics, and economy
The Definition of Kruskal’s Algorithm Kruskal’s algorithm is one to find minimum spanning tree in a graph connectivity which gives options of always processing the edge limit with the least weight. This algorithm run by considering the graph’s biggest edge limit when searching for track in node in a graph which has been put into a spanning tree

Summary

INTRODUCTION

The theories about graphs began in 1736 and several important discoveries in graph theory were obtained in the 19th century, but not until the 1920s that the interest in graph theory bloomed. The first text about graph theory emerged in 1936. One of the reasons for interest in graph theory is due to its application in many fields, including computer science, chemistry, operation research, electrical engineering, linguistics, and economy. Shows a highway system that must be supervised by the investigator officer. This investigator must make trips to all roads and make reports about their condition, the clarity of roads path, the condition of traffic signs, and so on. Because she lives in Yogyakarta, the most economic way in examining all roads must be started in Yogyakarta

LITERATURE REVIEW

The Definition of Spanning Tree

RESEARCH METHODOLOGY

CONCLUSION