Kruskal's algorithm: Given a weighted

Given a weighted, undirected, and connected graph with V vertices and E edges, the task is to find the sum of the weights of the edges in the Minimum Spanning Tree (MST) of the graph using Kruskal's Algorithm. The graph is represented as an edge list. In Kruskal's algorithm, we sort all edges of the given graph in increasing order. Then it keeps on adding new edges and nodes in the MST if the newly added edge does not form a cycle. It picks the minimum weighted edge at first and the maximum weighted edge at last. This article will discuss few important facts associated with minimum spanning trees, and then will give the simplest implementation of Kruskal's algorithm for finding minimum spanning tree. The Kruskal algorithm is a popular algorithm used to find the Minimum Spanning Tree (MST) in a graph, ensuring that the total edge weight is minimized while connecting all vertices. This algorithm is especially useful in network design and optimization.