Suppose a disconnected graph is input to Kruskal’s
Chapter 10, Problem 28E(choose chapter or problem)
Problem 28E
Suppose a disconnected graph is input to Kruskal’s algorithm. What will be the output?
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer