Kruskal's Algorithm Code | Part 6 | Graph - DSU and MST | CodeChef Tutorials

In this video series we will be learning Graphs in detail with Chirayu Jain. He'll explain Disjoint Set Union (DSU) and Minimum Spanning Trees(MST) for Kruskal's Algorithm.

The prerequisites of the series is basics of graphs. The aim of this algorithm is to construct a minimum spanning tree using greedy approaches and further optimizations.

🔵Reach out to us on any of our social media handles:

#Kruskal'sAlgorithm #Graph #DSU #MST #CodeChef