Specified set.Given a connected edge-weighted graph Gand a specified set of edges S(having no cycles), describe a way to find a minimum-weight spanning tree of Gamong those spanning trees that contain all the edges in S.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.