Design and Analysis of Algorithms
kruskal-algorithm
kruskal-algorithm-in-daa
daa
design-and-analysis-of-algorithms
minimum-spanning-tree
mst
greedy-algorithm
union-find
disjoint-set
graph-algorithms
Kruskal's Algorithm in Hinglish
Kruskal's Algorithm ek Greedy Algorithm hai jo edges ko increasing weight ke order mein select karke aur cycle create karne wali edges ko skip karke Minimum Spanning Tree (MST) find karta hai. Is article mein Union-Find, step-by-step example, cycle detection, complexity aur applications ko simple Hinglish mein explain kiya gaya hai.