Aim

The aim of Kruskal's Algorithm is to find the Minimum Spanning Tree (MST) of a connected, weighted graph, ensuring that the total weight of the edges in the tree is minimized.