# Prove following statement about Kruskal Algorithm

Let G be undirected graph, G=(V,E), and all edge weights are distinct. Consider an edge e=(u,v)∈E that wasn't included in the solution obtained from applying Kruskal Algorithm to G. Prove that this edge isn't in any Minimimum Spanning Tree of G.

• Do you perhaps also have that all edge weights are distinct? – JimN Sep 6 '20 at 23:05
• Yes, all edge weights are distinct. – Kate Austen Sep 6 '20 at 23:32
• You should probably include that In your first sentence in your question statement – JimN Sep 7 '20 at 0:01
• If this is quoted content, please attribute it properly - hyperlink welcome. Consider using a block quote (see, e.g, post editor tool bar "quotation mark button (")). – greybeard Sep 7 '20 at 14:17