Does minimum spanning tree exist with a disjointed graph?

by A_for_ Abacus   Last Updated July 12, 2019 07:20 AM

I was thinking that Prim's algorithm won't work with a disjointed graph. But maybe it doesn't have to.

When we're asking to find the minimum spanning tree of a graph, is it implicit that the supergraph will always be connected?

Tags : graph-theory


Related Questions


Updated August 12, 2018 18:20 PM

Updated July 18, 2015 13:08 PM

Updated May 26, 2019 17:20 PM

Updated April 18, 2018 10:20 AM