Considering graph B above (to the right) which includes solid and dotted edges. the solid edges form a minimum spanning tree T of weight 26. Assign weights to the dotted edges such that: each edge weight is a positive integer tree T remains a minimum spanning tree and to other tree is also a minimum spanning tree of the graph each of the assigned dotted edge weights is minimal