Undefined
BlogAbout

Find the Minimum Spanning Tree (MST)

April 12, 2021
Algorithm

What’s Minimum Spanning Tree (MST)?

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:

  • https://en.wikipedia.org/wiki/Minimum_spanning_tree
Previous
Designing a url shortening service like tiny url
Next
The top k elements in array

Comments