So the MST problem in general is you're given an undirected graph, like, for example, this four-node, five-edge graph, or presumably. something much larger and an interesting problem and you're supposed to quickly identify the minimum spanning tree like in this example the pink subgraph. 