Find the Minimum Spanning Tree (MST)
Algorithm
What’s Minimum Spanning Tree (MST)?
![]()
The Minimum Spanning Tree (MST) is a subset of edges. The edges has following characteristics:
- Connect all the vertices together.
- Have minimum total edge weight.
Algorithms
Example
Leetcode 1584
Reference:
Comments