W3-Spanning Tree

Minimum Spanning Trees (MST)¶

Definition¶

Example¶

How to verify the MST¶

Prim's Algorithm¶

Layzy Version¶

• Running Time: $O(|E|∗log⁡(|E|))$
  

Eager Version¶

Kruskal's Algorithm¶

• Time Complexity $O(|E|*log|E|)$