Which greedy algorithm finds the Minimum Spanning Tree of a graph by always adding the cheapest edge that does not form a cycle?
Show answer
Kruskal's algorithm
Kruskal's algorithm treats the graph as a forest and merges trees using the minimum weight edge. It typically uses a Disjoint Set Union data structure to detect cycles efficiently.
Also asked as:
- Which greedy MST algorithm functions by adding the lowest-weight edge that doesn't create a cycle?