edited by
506 views
1 votes
1 votes
Consider a graph G with positive and distinct edge weights :
$1)$ The highest weight edge will never be included in any MST : false if its in cut set
$2)$ There will be different MST but with equal weights : False again because applying any algorithm either prim or kruskal it will give same MST G'.
Please comment on my understanding.
edited by

1 Answer

Related questions