👤

prove that the maximum spanning tree of g contains the widest paths between every pair of vertices.