Question: Suppose that you run Kruskal's algorithm on a graph that is not connected, that is , there is a pair of vertices that are not
Suppose that you run Kruskal's algorithm on a graph that is not connected, that is there is a pair of vertices that are not connected by a path. What will the result be
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
