Suppose a disconnected graph is input to Kruskal’s algorithm. What will be the output?
The output to Kruskal’s algorithm, if a disconnected graph is input.
It will contain a minimal spanning tree for each connected component of the input graph.
The output will be a minimal spanning forest for the graph...
Bartleby provides explanations to thousands of textbook problems written by our experts, many with advanced degrees!Get Started