Kruskals Algorithm
← Back to Disjoint Set Union-Find
Greedy algorithm for minimum spanning tree. Sort edges by weight, add each edge if it doesn’t create a cycle (checked via Union-Find). Time O(E log E).
← Back to Disjoint Set Union-Find
Greedy algorithm for minimum spanning tree. Sort edges by weight, add each edge if it doesn’t create a cycle (checked via Union-Find). Time O(E log E).