How to make unconnected graph to connected one?

Hello~
I have N connected components in graph, G where N > 1.
How can I connect each connected component to the other reserving minimum weight so that G is connected graph?
Last edited on
Topic archived. No new replies allowed.