We will develop a new algorithm for finding minimum spanning trees. It is based on the following property: Pick any cycle in the graph, and let e be the heaviest edge in that cycle. Then there is a MST that does not contain e.

New algorithm is :

Sort the edges by their weights in decreasing order

For each edge e (picking in decreasing order),

if it is part of a cycle, remove it from G

Return the resulting G

Assume this property is correct , prove the algorithm is correct, please explain correctly.Please don't copy from other website!!!