Algorithm to find the maximum strength spanning tree

Question

Let G(V,E) to be an input graph. Let strength of the graph to be the minimum weight of any edges in it. Is finding the the maximum possible strength same as finding the maximum using either Kruskal’s/Prim's Algorithm to find the edge with maximum weight each time? I'm having a hard time thinking of a counterexample.

question from:https://stackoverflow.com/questions/65892488/algorithm-to-find-the-maximum-strength-spanning-tree

Answer 1

Waitting for answers