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 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 indepe...
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
EDP Sciences
2021-01-01
|
Series: | E3S Web of Conferences |
Subjects: | |
Online Access: | https://www.e3s-conferences.org/articles/e3sconf/pdf/2021/73/e3sconf_iccsre21_01062.pdf |