Spanning tree maximum, minimum

Hence the tree T as constructed by the algorithm (i)-(iii) is a minimum spanning tree of gi h G. If we have Cj = Cy for some j f, the minimum spanning tree need not be unique but the sum (A. 14) is equal for any such tree. If Cj Cj. for any j /, T is unique and we have strict inequality in (A.24). Clearly, a maximum tree will be found with the inverse order of arcs. 

---