KD-Graph(hdu2021第一场)
KD-Graph题目链接:link.Problem DescriptionLet’s call a weighted connected undirected graph of n vertices and m edges KD-Graph, if thefollowing conditions fulfill:n vertices are strictly divided into K groups, each group contains at least one verticei