TechAly Code on Instagram: "🌐 Kruskal’s Algorithm in DSA – How It Works 🌐 Kruskal’s Algorithm is used to find the Minimum Spanning Tree (MST) of a graph. It connects all vertices with the minimum possible total edge weight, without forming cycles. How it works: 1️⃣ Sort all edges in non-decreasing order of weights. 2️⃣ Pick the smallest edge. If it doesn’t form a cycle with the MST, include it. 3️⃣ Repeat until you have (V-1) edges for V vertices. 💡 Example: Think of building the cheapest roa