Minimum Spanning Tree
← Back to Graph Algorithms
A subset of edges that connects all vertices in a weighted undirected graph with the minimum possible total edge weight and no cycles. Used in network design, clustering, and approximation algorithms.
Key Properties
Related
- Shortest Path (related optimization on graphs)