Kruskal's algorithm is a greedy algorithm that finds a minimum spanning tree for a weighted undirected garph. The algorithm operates by adding the egdes one by one in the order of their increasing ...

/* A disjoint-set data structure is a data structure which stores partitions of a set of n elements in the form of disjoint sets. It performs 2 major operations : 1. Find : To determine if 2 elements ...

In this video, I walk you through Kruskal's Algorithm, a popular method in Graph Theory for finding the Minimum Cost Spanning Tree (MCST) of a graph. This algorithm efficiently builds a spanning tree ...