Suppose we have a weighted graph with n vertices,and at least n edges.Explain is wrong with the following approach for finding the minimum spanning tree:
while(the number of edges in the graph = n)
find the edge with the highest weight and delete it from the graph

Question

Suppose we have a weighted graph with n vertices,and at least n edges.Explain is wrong with the following approach for finding the minimum spanning tree:
while(the number of edges in the graph >= n)
find the edge with the highest weight and delete it from the graph

Quizplus · Accepted Answer

The Answer of Suppose we have a weighted graph with n vertices,and at least n edges.Explain is wrong with the following approach for finding the minimum spanning tree:
while(the number of edges in the graph >= n)
find the edge with the highest weight and delete it from the graph

Suppose We Have a Weighted Graph with N Vertices,and at Least