0
$\begingroup$

Given a weighted undirected graph and a list of edges (without cycles), how can I create an MST that contains all those edges (or says that such an MST does not exist)?

$\endgroup$
1
  • 1
    $\begingroup$ Hint, try building an MST from that list of edges, adapting Kruskal's algorithm. $\endgroup$
    – John L.
    Dec 3 '21 at 6:36

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.