State true of false for the following statement: Let T be a minimum spanning tree of a graph G, and let L be the sorted list of the edge weights of T. For any other minimum spanning tree T' of G, the list L is also the sorted list of edge weights of T' (Given edge weights are not unique).
A) True B) False
Answers
Answered by
0
Answer:
he hi sbsvdusv FB snsnjsbsbdbs xbsbss
Similar questions