Minimum Spanning Tree Using Kruskal’s algorithm

Minimum Spanning Tree Using Kruskal’s algorithm

Given a weighted, undirected and connected graph. The task is to find the sum of weights of the edges of the Minimum Spanning Tree

Kruskal’s algorithm is a minimum-spanning-tree algorithm which finds an edge of the least possible weight that connects any two trees in the forest.[1] It is a greedy algorithm in graph theory as it finds a minimum spanning tree for a connected weighted graph adding increasing cost arcs at each step.

Spanning Tree – A tree that spans all the vertices of a connected and undirected graph .

Spanning Tree Properties

for graph G(V, E), it contains exact (V-1) edges

Remove (E-V+1) edges

Maximally acyclic – Means after adding an edge will be cycle

Minimally connected – means removable of an edge from spinning tree it will give more than one components