Suppose a disconnected graph is input to Prim’s algorithm. What will be the output?
The output to Prim’s algorithm, if a disconnected graph is input.
It will contain a minimal spanning tree for each connected component of the input graph.
If a disconnected graph is given as an input in Prim’s algorithm then the output T is a circuit free sub graph of
Bartleby provides explanations to thousands of textbook problems written by our experts, many with advanced degrees!Get Started