Please enable JavaScript.
Coggle requires JavaScript to display documents.
MM9 - Coggle Diagram
MM9
Prim’s Algorithm
-
How It Works?
Grows the MST by adding the minimum-weight edge that connects a vertex in the tree to a vertex outside it.
-
Kruskal’s Algorithm
-
How It Works?
Sorts all edges by weight, then adds an edge only if it does not create a cycle.
Efficiency
Relies on Disjoint Sets (Union-Find) for efficient cycle checking. Time complexity is $O(E \log E)$.
-
-