AI engineering glossary · Data structures algorithms
What is MST (minimum spanning tree)?
Minimum spanning tree (also called MST): For a connected weighted graph, a subset of edges that links all vertices with no cycles and the smallest possible total weight. It is used to connect places at the lowest cost, such as laying cable.
Minimum spanning tree: an example
Connecting 6 villages with the least total length of road: an MST uses exactly 5 roads and is the cheapest way to make all villages reachable.
Related terms
More Data structures algorithms terms
- Monotonic stack
- NP-complete
- Open addressing
- Optimal substructure
- Overlapping subproblems
- P versus NP
- Polynomial time
- Prefix sum
Where you learn it
Minimum spanning tree is part of the AI Engineering Program, which teaches it with notes, a hands-on lab and an exam. The first lesson is free.