Question: Consider an undirected graph that may have negative edge weights. (a) Will Kruskal's algorithm still generate the minimum spanning tree? If so, explain why.
Consider an undirected graph that may have negative edge weights. (a) Will Kruskal's algorithm still generate the minimum spanning tree? If so, explain why. If not, give an example on which Kruskal's algorithm will fail. (b) Will Prim's algorithm still generate the minimum spanning tree? If so, explain why. If not, give an example on which Prim's algorithm will fail.
Step by Step Solution
There are 3 Steps involved in it
a Kruskals algorithm can still generate the minimum spanning tree even when the graph has negative e... View full answer
Get step-by-step solutions from verified subject matter experts
