Description
Given a connected undirected graph, tell if its minimum spanning tree is unique.
Given a connected undirected g
阅读背景：
poj1679 次最小生成树 kruskal（暴力枚举)
来源：互联网
分享到：
