Capacitated minimum spanning tree

The Capacitated Minimum Spanning Tree (CMST) is a variation of the traditional Minimum Spanning Tree (MST) problem, which is a fundamental problem in graph theory and network design. In a typical MST problem, you aim to find a spanning tree of a weighted graph that connects all the vertices with the minimum possible total edge weight. However, the CMST introduces additional constraints related to capacity.